{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:39:47Z","timestamp":1743010787497,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819712373"},{"type":"electronic","value":"9789819712380"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-1238-0_14","type":"book-chapter","created":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T18:30:58Z","timestamp":1709836258000},"page":"261-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Security Evaluation on\u00a0KpqC Round 1 Lattice-Based Algorithms Using Lattice Estimator"],"prefix":"10.1007","author":[{"given":"Suhri","family":"Kim","sequence":"first","affiliation":[]},{"given":"Eunmin","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Joohee","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Minju","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Hyuna","family":"Noh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. STOC \u201996, Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., G\u00f6pfert, F., Virdia, F., Wunderer, T.: Revisiting the expected cost of solving uSVP and applications to LWE. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2017. ASIACRYPT 2017. LNCS, vol. 10624, pp. 297\u2013322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_11","DOI":"10.1007\/978-3-319-70694-8_11"},{"key":"14_CR3","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Paper 2015\/046 (2015). https:\/\/eprint.iacr.org\/2015\/046"},{"key":"14_CR4","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange\u2014a new hope. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 327\u2013343. USENIX Association, Austin, TX, August 2016. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Baan, H., et al.: Round5: Compact and Fast Post-quantum Public-Key Encryption, pp. 83\u2013102, July 2019. https:\/\/doi.org\/10.1007\/978-3-030-25510-7_5","DOI":"10.1007\/978-3-030-25510-7_5"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2012. EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"14_CR7","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime: reducing attack surface at low cost. Cryptology ePrint Archive, Paper 2016\/461 (2016). https:\/\/eprint.iacr.org\/2016\/461"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: On the hardness of module-LWE with binary secret. In: Paterson, K.G. (eds.) Topics in Cryptology \u2013 CT-RSA 2021. CT-RSA 2021. LNCS, vol. 12704, pp. 503\u2013526. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_21","DOI":"10.1007\/978-3-030-75539-3_21"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"14_CR10","unstructured":"Center, K.R.: KPQC competition round 1. https:\/\/www.kpqc.or.kr\/competition.html. Accessed June 2023"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Chailloux, A., Loyer, J.: Lattice sieving via quantum random walks (2021)","DOI":"10.1007\/978-3-030-92068-5_3"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: Bkz 2.0: Better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2011. ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2019.2925425","volume":"7","author":"JH Cheon","year":"2019","unstructured":"Cheon, J.H., Hhan, M., Hong, S., Son, Y.: A hybrid of dual and meet-in-the-middle attack on sparse and ternary secret LWE. IEEE Access 7, 89497\u201389506 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2925425","journal-title":"IEEE Access"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, D., Lee, J., Song, Y.: Lizard: cut off the tail! A practical post-quantum public-key encryption from LWE and LWR. In: Catalano, D., De Prisco, R. (eds.) Security and Cryptography for Networks. SCN 2018. LNCS, vol. 11035, pp. 160\u2013177. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_9","DOI":"10.1007\/978-3-319-98113-0_9"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians.. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology \u2013 CRYPTO 2013. CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Ducas, L., et al.: Crystals-dilithium: a lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, pp. 238\u2013268 (2018)","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Duman, J., H\u00f6velmanns, K., Kiltz, E., Lyubashevsky, V., Seiler, G., Unruh, D.: A thorough treatment of highly-efficient NTRU instantiations. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023. PKC 2023. LNCS, vol. 13940, pp. 65\u201394. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_3","DOI":"10.1007\/978-3-031-31368-4_3"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (eds.) Advances in Cryptology \u2013 CRYPTO\u2019 99. CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34","DOI":"10.1007\/3-540-48405-1_34"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (eds.) Algorithmic Number Theory. ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N.: A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Menezes, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2007. CRYPTO 2007. LNCS, vol. 4622, pp. 150\u2013169. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_9","DOI":"10.1007\/978-3-540-74143-5_9"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1109\/ACCESS.2018.2884084","volume":"7","author":"J Lee","year":"2018","unstructured":"Lee, J., Kim, D., Lee, H., Lee, Y., Cheon, J.H.: Rlizard: post-quantum key encapsulation mechanism for IoT devices. IEEE Access 7, 2080\u20132091 (2018)","journal-title":"IEEE Access"},{"key":"14_CR22","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for lwe-based encryption. Cryptology ePrint Archive, Paper 2010\/613 (2010). https:\/\/eprint.iacr.org\/2010\/613"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2009. ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2012. EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"issue":"6","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (JACM) 60(6), 1\u201335 (2013)","journal-title":"J. ACM (JACM)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Seiler, G.: NTTRU: truly fast NTRU using NTT. Cryptology ePrint Archive (2019)","DOI":"10.46586\/tches.v2019.i3.180-201"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"May, A.: How to meet ternary LWE keys. Cryptology ePrint Archive, Paper 2021\/216 (2021). https:\/\/eprint.iacr.org\/2021\/216","DOI":"10.1007\/978-3-030-84245-1_24"},{"key":"14_CR28","unstructured":"NIST: Post-quantum cryptography. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography. Accessed June 2023"},{"key":"14_CR29","unstructured":"NIST: Standardization of additional digital signature schemes. https:\/\/csrc.nist.gov\/projects\/pqc-dig-sig\/standardization. Accessed August 2023"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Johansson, T.: Advances in cryptology - EUROCRYPT 2012 : 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 15\u201319 April 2012, Proceedings. LNCS, vol. 7237, EUROCRYPT (31st : 2012 : Cambridge, England), Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4","DOI":"10.1007\/978-3-642-29011-4"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/s0097539795293172","DOI":"10.1137\/s0097539795293172"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-1238-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T18:32:52Z","timestamp":1709836372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-1238-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819712373","9789819712380"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-1238-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"8 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/static\/pastconferences","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"31","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":"40% - 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":"2","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":"2","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)"}}]}}