{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:12:24Z","timestamp":1757311944778,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904272"},{"type":"electronic","value":"9783030904289"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90428-9_7","type":"book-chapter","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:02:54Z","timestamp":1635577374000},"page":"151-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analysis of In-Place Randomized Bit-Flipping Decoders for the Design of LDPC and MDPC Code-Based Cryptosystems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8754-5526","authenticated-orcid":false,"given":"Marco","family":"Baldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0840-6358","authenticated-orcid":false,"given":"Alessandro","family":"Barenghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6994-1448","authenticated-orcid":false,"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3812-5429","authenticated-orcid":false,"given":"Gerardo","family":"Pelosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0631-3668","authenticated-orcid":false,"given":"Paolo","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,31]]},"reference":[{"key":"7_CR1","unstructured":"Albrecht, M.R., et al.: Classic McEliece website. https:\/\/classic.mceliece.org (2020)"},{"key":"7_CR2","unstructured":"Aragon, N., et al.: BIKE website. https:\/\/bikesuite.org (2020)"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAkem: a post-quantum Key encapsulation mechanism based on QC-LDPC codes. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 3\u201324. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_1","DOI":"10.1007\/978-3-319-79063-3_1"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.3390\/a12100209","volume":"12","author":"M Baldi","year":"2019","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: A finite regime analysis of information set decoding algorithms. Algorithms 12, 209 (2019)","journal-title":"Algorithms"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate. In: Baldi, M., Persichetti, E., Santini, P. (eds.) Code-Based Cryptography. CBC 2019. Lecture Notes in Computer Science, vol. 11666, pp. 11\u201343. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25922-8_2","DOI":"10.1007\/978-3-030-25922-8_2"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: A failure rate model of bit-flipping decoders for QC-LDPC and QC-MDPC code-based cryptosystems. In: Samarati, P., di Vimercati, S.D.C., Obaidat, M.S., Ben-Othman, J. (eds.) Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, ICETE 2020, vol. 2, pp. 238\u2013249 SECRYPT, Lieusaint, Paris, France, ScitePress (2020). https:\/\/doi.org\/10.5220\/0009891702380249","DOI":"10.5220\/0009891702380249"},{"key":"7_CR7","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAcrypt website. https:\/\/www.ledacrypt.org (2020)"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Baldi, M., Chiaraluce, F., Garello, R., Mininni, F.: Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: Proceedings of IEEE International Conference on Communications, ICC 2007, Glasgow, Scotland, UK, pp. 951\u2013956 (2007). https:\/\/doi.org\/10.1109\/ICC.2007.161","DOI":"10.1109\/ICC.2007.161"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Barenghi, A., Pelosi, G.: A comprehensive analysis of constant-time polynomial inversion for post-quantum cryptosystems. In: Palesi, M., Palermo, G., Graves, C., Arima, E. (eds.) Proceedings of the 17th ACM International Conference on Computing Frontiers, CF 2020, pp. 269\u2013276. Catania, Sicily, Italy, 2020. ACM (2020). https:\/\/doi.org\/10.1145\/3387902.3397224","DOI":"10.1145\/3387902.3397224"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Barenghi, A., Pelosi, G.: Constant weight strings in constant time: a building block for code-based post-quantum cryptosystems. In: Palesi, M., Palermo, G., Graves, C., Arima, E. (eds.) Proceedings of the 17th ACM International Conference on Computing Frontiers, CF 2020, pp. 132\u2013141. Catania, Sicily, Italy 2020, ACM (2020). https:\/\/doi.org\/10.1145\/3387902.3392630","DOI":"10.1145\/3387902.3392630"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Bindel, N., Hamburg, M., H\u00f6velmanns, K., H\u00fclsing, A., Persichetti, E.: Tighter proofs of CCA security in the quantum random oracle model. Cryptology ePrint Archive, Report 2019\/590 (2019). https:\/\/eprint.iacr.org\/2019\/590","DOI":"10.1007\/978-3-030-36033-7_3"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S.: A toolbox for software optimization of QC-MDPC code-based cryptosystems. J. Cryptograph. Eng. 9(4), 341\u2013357 (2019). https:\/\/doi.org\/10.1007\/s13389-018-00200-4","DOI":"10.1007\/s13389-018-00200-4"},{"key":"7_CR13","unstructured":"Drucker, N., Gueron, S., Kostic, D.: QC-MDPC decoders with several shades of gray. Cryptology ePrint Archive, Report 2019\/1423 (2019). https:\/\/eprint.iacr.org\/2019\/1423"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Fab\u0161i\u010d, T., Hromada, V., Stankovski, P., Zajac, P., Guo, Q., Johansson, T.: A reaction attack on the QC-LDPC McEliece cryptosystem. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 51\u201368. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_4","DOI":"10.1007\/978-3-319-59879-6_4"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., Tillich, J.P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: EUROCRYPT. Lecture Notes in Computer Science, vol. 6110, pp. 279\u2013298. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low-density parity-check codes. Ph.D. Thesis, M.I.T. (1963)","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: A key recovery attack on MDPC with CCA security using decoding errors. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 789\u2013815. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_29","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Hashemi, Y., Banihashemi, A.H.: Characterization and efficient search of non-elementary trapping sets of LDPC codes with applications to stopping sets. IEEE Trans. Inf. Theory 65(2), 1017\u20131033 (2019)","DOI":"10.1109\/TIT.2018.2865385"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) Theory of Cryptography. TCC 2017. Lecture Notes in Computer Science, vol. 10677, pp. 341\u2013371. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. pp. 85\u2013103. The IBM Research Symposia Series, Springer, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"7_CR21","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Netw. Prog. Report 44, 114\u2013116 (1978)"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.L.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT 2013), pp. 2069\u20132073. Istanbul, Turkey (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"7_CR23","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Con. Inf. Theory 15 (1986)"},{"key":"7_CR24","unstructured":"NIST: Post-quantum cryptography. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"7_CR25","unstructured":"Richardson, T.: Error floors of LDPC codes. In: Proceedings of 41st Annual Allerton Conference Communication Control Computing, pp. 1426\u20131435. Monticello, IL, USA (2003)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Salomaa, A.: Finite non-deterministic and probabilistic automata. In: Theory of Automata, Chapter II, Monographs on Pure and Applied Mathematics, vol. 100. Pergamon (1969)","DOI":"10.1016\/B978-0-08-013376-8.50008-3"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Santini, P., Battaglioni, M., Baldi, M., Chiaraluce, F.: Hard-decision iterative decoding of LDPC codes with bounded error rate. In: Proceedings of IEEE Conference on Communications (ICC 2019), Shanghai, China (2019). https:\/\/doi.org\/10.1109\/ICC.2019.8761536","DOI":"10.1109\/ICC.2019.8761536"},{"issue":"8","key":"7_CR28","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1109\/TCOMM.2020.2987898","volume":"68","author":"P Santini","year":"2020","unstructured":"Santini, P., Battaglioni, M., Baldi, M., Chiaraluce, F.: A theoretical analysis of the error correction capability of LDPC and MDPC codes under parallel bit-flipping decoding and application to cryptography. IEEE Trans. Commun. 68(8), 1017\u20131033 (2020)","journal-title":"IEEE Trans. Commun."},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Santini, P., Battaglioni, M., Chiaraluce, F., Baldi, M.: Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes. In: Code-Based Cryptography. CBC 2019. Lecture Notes in Computer Science, vol. 11666, pp. 115\u2013136. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25922-8_7","DOI":"10.1007\/978-3-030-25922-8_7"},{"key":"7_CR30","unstructured":"Sendrier, N., Vasseur, V.: About low DFR for QC-MDPC decoding. Cryptology ePrint Archive, Report 2019\/1434 (2019). https:\/\/eprint.iacr.org\/2019\/1434"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Sendrier, N., Vasseur, V.: On the decoding failure rate of QC-MDPC bit-flipping decoders. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. Lecture Notes in Computer Science, vol. 11505, pp. 404\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_22","DOI":"10.1007\/978-3-030-25510-7_22"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Tillich, J.: The decoding failure probability of MDPC codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT 2018), Vail, CO, USA, pp. 941\u2013945 (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437843","DOI":"10.1109\/ISIT.2018.8437843"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90428-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:04:13Z","timestamp":1635577453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90428-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904272","9783030904289"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90428-9_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICETE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on E-Business and Telecommunications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icete2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icete.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}