{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:16:50Z","timestamp":1781885810196,"version":"3.54.5"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2052641"],"award-info":[{"award-number":["2052641"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The medium-density parity-check (MDPC) code-based cryptosystem remains a finalist of the post-quantum cryptography standard. The row-layered Min-Sum decoding achieves an efficient trade-off between performance and complexity. Parallel row-layered MDPC decoders are designed in previous studies by enforcing constraints on the parity-check matrix. The preliminary work introduces two schemes to reduce the latency without increasing the constraints on the parity-check matrix, which may bring security concerns. The first scheme simultaneously processes multiple identity blocks in the parity-check matrix, and the second processes a larger block of variable width each time. However, their speedup is limited by data access conflicts. In this paper, optimizations are proposed for the computation scheduling of each scheme to further reduce the latency. Out-of-order processing of identity blocks is proposed for the first scheme to reduce memory access conflicts, enabling more simultaneous processing of multiple blocks. For the second scheme, out-of-order processing of block segments is explored to update more messages simultaneously without causing conflicts in layered decoding. Efficient hardware architectures have also been designed for both of the proposed scheduling optimizations. For an example code, the two proposed optimizations achieve 35% and 9%, respectively, speedup over the best prior designs with negligible area overhead. The out-of-order processing is more effective on the first design.<\/jats:p>","DOI":"10.1007\/s11265-025-01964-9","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T11:07:50Z","timestamp":1757416070000},"page":"257-268","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Low-Latency Parallel Row-Layered Min-Sum Decoders with Scheduling Optimization for MDPC Code-Based Post-Quantum Cryptography"],"prefix":"10.1007","volume":"97","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0008-4164-6664","authenticated-orcid":false,"given":"Jiaxuan","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinmiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"1964_CR1","unstructured":"NIST. (2024). Post-quantum cryptography. NIST. Accessed: Sep. 2024. [Online]. Available: https:\/\/2.zoppoz.workers.dev:443\/https\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"1964_CR2","unstructured":"Aragon, N., et al. (2024). BIKE: Bit flipping key encapsulation, Round 4 Submission. NIST. Accessed: Sep. 2024. [Online]. Available: https:\/\/2.zoppoz.workers.dev:443\/https\/bikesuite.org"},{"key":"1964_CR3","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., & Barreto, P.S.L.M. (20113). MDPC-McEliece: new McEliece variants from moderate density parity-check codes. IEEE international symposium on information theory (pp. 2069-2073)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"1964_CR4","unstructured":"Bartz, H., & Liva, G. (2019). On decoding schemes for the MDPC-McEliece cryptosystem. Proceedings of International ITG Conference on Systems, Communications and Coding (pp. 1-6)"},{"issue":"4","key":"1964_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.46586\/tches.v2022.i4.110-134","volume":"2022","author":"TB Paiva","year":"2022","unstructured":"Paiva, T. B., & Terada, R. (2022). Faster constant-time decoder for MDPC codes and applications to BIKE KEM. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2022(4), 110\u2013134.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"issue":"8","key":"1964_CR6","doi-asserted-by":"publisher","first-page":"4648","DOI":"10.1109\/TCOMM.2020.2987898","volume":"68","author":"P Santini","year":"2020","unstructured":"Santini, P., Battaglioni, M., Baldi, M., & Chiaraluce, F. (2020). Analysis of the error correction capability of LDPC and MDPC codes under parallel bit-flipping decoding and application to cryptography. IEEE Transactions on Communications, 68(8), 4648\u20134660.","journal-title":"IEEE Transactions on Communications"},{"key":"1964_CR7","doi-asserted-by":"crossref","unstructured":"Arpin, S., et al. (2022). A study of error floor behavior in QC-MDPC codes. Proceedings of International Conference on Post-Quantum Cryptography (pp. 89-103)","DOI":"10.1007\/978-3-031-17234-2_5"},{"key":"1964_CR8","doi-asserted-by":"crossref","unstructured":"Maurich, I.V., & G\u00fcneysu, T. (2014). Lightweight code-based cryptography: QC-MDPC McEliece encryption on reconfigurable devices. Proceedings of IEEE Design, Automation & Test in Europe Conference & Exhibition (pp. 1-6).","DOI":"10.7873\/DATE2014.051"},{"issue":"3","key":"1964_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2700102","volume":"14","author":"IV Maurich","year":"2015","unstructured":"Maurich, I. V., Oder, T., & G\u00fcneysu, T. (2015). Implementing QC-MDPC McEliece encryption. ACM Transactions on Embedded Computing Systems, 14(3), 1\u201327.","journal-title":"ACM Transactions on Embedded Computing Systems"},{"issue":"8","key":"1964_CR10","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TC.2017.2672984","volume":"66","author":"J Hu","year":"2017","unstructured":"Hu, J., & Cheung, R. (2017). Area-time efficient computation of Niederreiter encryption on QC-MDPC codes for embedded hardware. IEEE Transactions on Computers, 66(8), 1313\u20131325.","journal-title":"IEEE Transactions on Computers"},{"key":"1964_CR11","doi-asserted-by":"crossref","unstructured":"Xie, Z., & Zhang, X. (2023). Sparsity-aware medium-density parity-check decoder for McEliece cryptosystems. IEEE Transactions on Circuits and Systems-II, 70(9), 3343\u20133347.","DOI":"10.1109\/TCSII.2023.3264578"},{"key":"1964_CR12","doi-asserted-by":"crossref","unstructured":"Cai, J., & Zhang, X. (2025). Efficient layered new bit-flipping QC-MDPC decoder for BIKE post-quantum cryptography. Proceedings of IEEE International Symposium of Circuits and Systems (pp. 1-5).","DOI":"10.1109\/ISCAS56072.2025.11043849"},{"issue":"5","key":"1964_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/4234.1001666","volume":"6","author":"J Chen","year":"2002","unstructured":"Chen, J., & Fossorier, M. (2002). Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Communucations Letters, 6(5), 208\u2013210.","journal-title":"IEEE Communucations Letters"},{"issue":"12","key":"1964_CR14","doi-asserted-by":"publisher","first-page":"5328","DOI":"10.1109\/TCSI.2023.3319358","volume":"70","author":"J Cai","year":"2023","unstructured":"Cai, J., & Zhang, X. (2023). Low-complexity parallel Min-sum medium-density parity-check decoder for McEliece cryptosystem. IEEE Transactions on Circuits and Systems-I, 70(12), 5328\u20135338.","journal-title":"IEEE Transactions on Circuits and Systems-I"},{"key":"1964_CR15","doi-asserted-by":"crossref","unstructured":"Cai, J., & Zhang, X. (2024). Highly efficient parallel row-layered Min-Sum MDPC decoder for McEliece cryptosystem. arXiv preprint arXiv:2407.12695.","DOI":"10.1109\/SiPS62058.2024.00034"},{"key":"1964_CR16","doi-asserted-by":"crossref","unstructured":"Cai, J., & Zhang, X. (2024). Low-latency parallel row-layered Min-sum MDPC decoder for McEliece cryptosystem. Proceedings of IEEE Workshop on Signal Processing Systems (pp. 147-152).","DOI":"10.1109\/SiPS62058.2024.00034"},{"key":"1964_CR17","doi-asserted-by":"crossref","unstructured":"Guo, Q., Johansson, T., & Stankovski, P. (2016). A key recovery attack on MDPC with CCA security using decoding errors. Proceedings of ASIACRYPT (pp. 789-815).","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"1964_CR18","doi-asserted-by":"crossref","unstructured":"Santini, P., Battaglioni, M., Chiaraluce, F., & Baldi, M. (2019). Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes. Proceedings of Code-Based Cryptography: 7th International Workshop (pp. 115-136).","DOI":"10.1007\/978-3-030-25922-8_7"},{"issue":"3","key":"1964_CR19","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/JSSC.2005.864133","volume":"41","author":"M Mansour","year":"2006","unstructured":"Mansour, M., & Shanbhag, N. (2006). A 640-Mb\/s 2048-bit programmable LDPC decoder chip. IEEE Journal of Solid-State Circuits, 41(3), 684\u2013698.","journal-title":"IEEE Journal of Solid-State Circuits"},{"key":"1964_CR20","volume-title":"VLSI Architectures for Modern Error Correcting Codes","author":"X Zhang","year":"2015","unstructured":"Zhang, X. (2015). VLSI Architectures for Modern Error Correcting Codes. CRC Press."},{"key":"1964_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, X., & Tai, Y. (2014). High-speed multi-block-row layered decoding for Quasi-cyclic LDPC codes. Proceedings of IEEE Global Conference on Signal and Information Processing (pp. 11-14).","DOI":"10.1109\/GlobalSIP.2014.7032068"},{"key":"1964_CR22","doi-asserted-by":"crossref","unstructured":"Sun, Y., Wang, G., Cavallaro, J. (2011). Multi-layer parallel decoding algorithm and VLSI architecture for quasi-cyclic LDPC codes. Proceedings of IEEE International Symposium of Circuits and Systems (pp. 1776-1779).","DOI":"10.1109\/ISCAS.2011.5937928"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s11265-025-01964-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s11265-025-01964-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s11265-025-01964-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T11:08:44Z","timestamp":1761563324000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s11265-025-01964-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"references-count":22,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1964"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s11265-025-01964-9","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"3 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare for this material.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"This study does not involve any research with human participants or animals conducted by the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}}]}}