{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:04:17Z","timestamp":1743026657760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030540739"},{"type":"electronic","value":"9783030540746"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54074-6_5","type":"book-chapter","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T23:19:23Z","timestamp":1595891963000},"page":"80-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Protograph-Based Decoding of Low-Density Parity-Check Codes with Hamming Weight Amplifiers"],"prefix":"10.1007","author":[{"given":"Hannes","family":"Bartz","sequence":"first","affiliation":[]},{"given":"Emna Ben","family":"Yacoub","sequence":"additional","affiliation":[]},{"given":"Lorenza","family":"Bertarelli","sequence":"additional","affiliation":[]},{"given":"Gianluigi","family":"Liva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"5_CR1","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic codes. Deep Space Netw. Progr. Rep. 44, 114\u2013116 (1978)","journal-title":"Deep Space Netw. Progr. Rep."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"5_CR3","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: Proceedings IEEE International Symposium Information Theory (ISIT), Sorrento, Italy, p. 215 (2000)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes. In: IEEE International Symposium on Information Theory, pp. 2591\u20132595 (2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3(2), 129\u2013140 (2010)","journal-title":"Math. Comput. Sci."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the mceliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 246\u2013262. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85855-3_17"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F.:Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems. In: 2013 IEEE International Conference on Communications Workshops (ICC), pp. 707\u2013711. IEEE(2013)","DOI":"10.1109\/ICCW.2013.6649325"},{"key":"5_CR8","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAcrypt: low-dEnsity parity-checkcoDe-bAsed cryptographic systems. NIST PQC submission (2019). https:\/\/www.ledacrypt.org\/"},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. M.I.T. Press, Cambridge (1963)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TIT.1967.1053994","volume":"13","author":"L Rudolph","year":"1967","unstructured":"Rudolph, L.: A class of majority logic decodable codes (corresp.). IEEE Trans. Inf. Theory 13(2), 305\u2013307 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, pp. 2069\u20132073 (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44586-2_2","volume-title":"Public Key Cryptography","author":"K Kobara","year":"2001","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems -conversions for McEliece PKC. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 19\u201335. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_2"},{"key":"5_CR13","unstructured":"Thorpe, J.: Low-density parity-check (LDPC) codes constructed from protographs. JPL IPN, Technical report, pp. 42\u2013154, August 2003"},{"key":"5_CR14","unstructured":"Abbasfar, A., Yao, K., Disvalar, D.: Accumulate repeat accumulate codes. In: Proceedings of IEEE Globecomm, Dallas, Texas (2004)"},{"issue":"6","key":"5_CR15","first-page":"876","volume":"27","author":"D Divsalar","year":"2009","unstructured":"Divsalar, D., Dolinar, S., Jones, C., Andrews, K.: Capacity-approaching protograph codes. IEEE JSAC 27(6), 876\u2013888 (2009)","journal-title":"IEEE JSAC"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Liva, G., Chiani, M.: Protograph LDPC code design based on EXIT analysis. In: Proceedings of IEEE Globecomm, Washington, US, pp. 3250\u20133254, December 2007","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"5_CR17","unstructured":"Bartz, H., Liva, G.: On decoding schemes for the MDPC-McEliece cryptosystem. In: 12th International ITG Conference on Systems, Communications and Coding (SCC), pp. 1\u20136. VDE (2019)"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TCOMM.2011.122111.100212","volume":"60","author":"G Lechner","year":"2011","unstructured":"Lechner, G., Pedersen, T., Kramer, G.: Analysis and design of binary message passing decoders. IEEE Trans. Commun. 60(3), 601\u2013607 (2011)","journal-title":"IEEE Trans. Commun."},{"key":"5_CR19","unstructured":"Yacoub, E.B., Steiner, F., Matuz, B., Liva, G.: Protograph-based LDPC code design for ternary message passing decoding. In: 12th International ITG Conference on Systems, Communications and Coding, SCC 2019, pp. 1\u20136. VDE, February 2019"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4234.905935","volume":"5","author":"S-Y Chung","year":"2001","unstructured":"Chung, S.-Y., Forney, G.D., Richardson, T.J., Urbanke, R.: On the design of low-density parity-check codes within $$0.0045$$ dB of the Shannon limit. IEEE Commun. Lett. 5(2), 58\u201360 (2001)","journal-title":"IEEE Commun. Lett."},{"key":"5_CR21","unstructured":"Jin, H., Richardson, T.: A new fast density evolution. In: 2006 IEEE Information Theory Workshop-ITW Punta del Este, pp. 183\u2013187. IEEE (2006)"},{"issue":"11","key":"5_CR22","doi-asserted-by":"publisher","first-page":"5646","DOI":"10.1109\/TWC.2013.100113.121853","volume":"12","author":"P Pulini","year":"2013","unstructured":"Pulini, P., Liva, G., Chiani, M.: Unequal diversity LDPC codes for relay channels. IEEE Trans. Wirel. Commun. 12(11), 5646\u20135655 (2013)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/18.910580","volume":"47","author":"S-Y Chung","year":"2001","unstructured":"Chung, S.-Y., Richardson, T.J., Urbanke, R.L.: Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Trans. Inf. Theory 47(2), 657\u2013670 (2001)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54074-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:23:20Z","timestamp":1619231000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54074-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030540739","9783030540746"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54074-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbcrypto.dii.univpm.it\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","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":"7","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":"0","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":"70% - 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":"1","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}