{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:40:09Z","timestamp":1770741609262,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030109691","type":"print"},{"value":"9783030109707","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10970-7_17","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T10:12:15Z","timestamp":1547287935000},"page":"369-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Analysis of Error-Correcting Codes for Lattice-Based Key Exchange"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5483-4292","authenticated-orcid":false,"given":"Tim","family":"Fritzmann","sequence":"first","affiliation":[]},{"given":"Thomas","family":"P\u00f6ppelmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3686-994X","authenticated-orcid":false,"given":"Johanna","family":"Sepulveda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"17_CR1","unstructured":"Alkim, E., et al.: NewHope: Algorithm Specifications and Supporting Documentation (2017). https:\/\/newhopecrypto.org\/data\/NewHope_2017_12_21.pdf"},{"key":"17_CR2","unstructured":"Alkim, E., et al.: FrodoKEM - Learning with Errors Key Encapsulation: Algorithm Specifications and Supporting Documentation (2017). https:\/\/frodokem.org\/files\/FrodoKEM-specification-20171130.pdf"},{"key":"17_CR3","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: NewHope without reconciliation. IACR Cryptology ePrint Archive 2016, 1157 (2016)"},{"key":"17_CR4","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: 25th USENIX Security Symposium, USENIX Security 16, 10\u201312 August 2016, Austin, TX, USA, pp. 327\u2013343 (2016)"},{"key":"17_CR5","unstructured":"Avanzi, R., et al.: CRYSTALS-Kyber: Algorithm Specifications and Supporting Documentation (2017). https:\/\/www.pq-crystals.org\/kyber\/data\/kyber-specification.pdf"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-04852-9_2","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"S Bai","year":"2014","unstructured":"Bai, S., Galbraith, S.D.: An improved compression technique for signatures based on learning with errors. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 28\u201347. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_2"},{"key":"17_CR7","unstructured":"Barreto, P.S., Longa, P., Naehrig, M., Ricardini, J.E., Zanon, G.: Sharper Ring-LWE signatures. IACR Cryptology ePrint Archive 2016, 1026 (2016)"},{"key":"17_CR8","unstructured":"Berlekamp, E.R.: Nonbinary BCH decoding. In: International Symposium on Information Theory, San Remo, Italy (1966)"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: Frodo: take off the ring! practical, quantum-secure key exchange from LWE. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 24\u201328 October 2016, Vienna, Austria, pp. 1006\u20131018 (2016). https:\/\/doi.org\/10.1145\/2976749.2978425","DOI":"10.1145\/2976749.2978425"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Bos, J.W., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. IACR Cryptology ePrint Archive 2017, 634 (2017)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"17_CR11","unstructured":"Cheon, J.H., Kim, D., Lee, J., Song, Y.S.: Lizard: Cut off the tail! \/\/ practical post-quantum public-key encryption from LWE and LWR. IACR Cryptology ePrint Archive 2016, 1126 (2016)"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TIT.1964.1053699","volume":"10","author":"RT Chien","year":"1964","unstructured":"Chien, R.T.: Cyclic decoding procedures for Bose-Chaudhuri-Hocquenghem codes. IEEE Trans. Inf. Theory 10(4), 357\u2013363 (1964). https:\/\/doi.org\/10.1109\/TIT.1964.1053699","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. Cryptology ePrint Archive, Report 2013\/383 (2013)","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"17_CR14","series-title":"The Springer International Series in Engineering and Computer Science","volume-title":"Constrained Coding and Soft Iterative Decoding","author":"J Fan","year":"2012","unstructured":"Fan, J.: Constrained Coding and Soft Iterative Decoding. The Springer International Series in Engineering and Computer Science. Springer, Heidelberg (2012)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO 99","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21\u201328 (1962). https:\/\/doi.org\/10.1109\/TIT.1962.1057683","journal-title":"IRE Trans. Inf. Theory"},{"key":"17_CR17","series-title":"Applications of Communications Theory","volume-title":"Data Communications Principles","author":"R Gitlin","year":"2012","unstructured":"Gitlin, R., Hayes, J., Weinstein, S.: Data Communications Principles. Applications of Communications Theory. Springer, Heidelberg (2012)"},{"key":"17_CR18","unstructured":"Hamburg, M.: Supporting documentation: ThreeBears (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Hu, X., Eleftheriou, E., Arnold, D., Dholakia, A.: Efficient implementations of the sum-product algorithm for decoding LDPC codes. In: Proceedings of the Global Telecommunications Conference, GLOBECOM 2001, 25\u201329 November 2001, San Antonio, TX, USA, p. 1036 (2001). https:\/\/doi.org\/10.1109\/GLOCOM.2001.965575","DOI":"10.1109\/GLOCOM.2001.965575"},{"key":"17_CR21","volume-title":"Error Control Coding","author":"S Lin","year":"2004","unstructured":"Lin, S., Costello, D.J.: Error Control Coding, 2nd edn. Prentice-Hall Inc., Upper Saddle River (2004)","edition":"2"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_21"},{"key":"17_CR23","unstructured":"Lu, X., Liu, Y., Jia, D., Xue, H., He, J., Zhang, Z.: Supporting documentation: LAC (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"17_CR25","unstructured":"National Institute of Standards and Technology: Announcing request for nominations for public-key post-quantum cryptographic algorithms (2016). https:\/\/csrc.nist.gov\/news\/2016\/public-key-post-quantum-cryptographic-algorithms"},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TST.2013.6449408","volume":"18","author":"C Qian","year":"2013","unstructured":"Qian, C., Lei, W., Wang, Z.: Low complexity LDPC decoder with modified Sum-Product algorithm. Tsinghua Sci. Technol. 18(1), 57\u201361 (2013). https:\/\/doi.org\/10.1109\/TST.2013.6449408","journal-title":"Tsinghua Sci. Technol."},{"key":"17_CR27","unstructured":"Richardson, T.: Error floors of LDPC codes. In: Proceedings of the Annual Allerton Conference on Communication Control and Computing, pp. 1426\u20131435. The University; 1998 (2003)"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Saarinen, M.O.: HILA5: On reliability, reconciliation, and error correction for Ring-LWE encryption. IACR Cryptology ePrint Archive 2017, 424 (2017)","DOI":"10.1007\/978-3-319-72565-9_10"},{"key":"17_CR29","unstructured":"Saarinen, M.J.O.: Supporting documentation: HILA5 (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"},{"key":"17_CR30","volume-title":"Digital Communications","author":"M Safak","year":"2017","unstructured":"Safak, M.: Digital Communications. Wiley, Hoboken (2017)"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-662-53644-5_8","volume-title":"Theory of Cryptography","author":"EE Targhi","year":"2016","unstructured":"Targhi, E.E., Unruh, D.: Post-quantum security of the Fujisaki-Okamoto and OAEP transforms. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 192\u2013216. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_8"},{"key":"17_CR32","unstructured":"Zhao, Y., Jin, Z., Gong, B., Sui, G.: Supporting documentation: KCL (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10970-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T01:05:39Z","timestamp":1673485539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10970-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109691","9783030109707"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10970-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calgary, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ucalgary.ca\/cpsc\/selected-areas-cryptography\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","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":"22","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":"39% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}