{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:52:19Z","timestamp":1779900739231,"version":"3.53.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253262","type":"print"},{"value":"9783032253279","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-25327-9_1","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:36:33Z","timestamp":1778085393000},"page":"3-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Closer Look at\u00a0Falcon"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4997-2276","authenticated-orcid":false,"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phillip","family":"Gajland","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hubert","family":"de Groote","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1385-3884","authenticated-orcid":false,"given":"Jonas","family":"Janneck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1178-048X","authenticated-orcid":false,"given":"Eike","family":"Kiltz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in $$2^n$$ time using discrete Gaussian sampling: extended abstract. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, pp. 733\u2013742. ACM Press, Portland (2015). https:\/\/doi.org\/10.1145\/2746539.2746606","DOI":"10.1145\/2746539.2746606"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM Press, Philadephia (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"1_CR3","unstructured":"Albrecht, M.R., Player, R., Scott, S.: Lattice estimator (2015). https:\/\/github.com\/malb\/lattice-estimator. commit: 14a362513c9197dd959bc72428425abe0309779a"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","DOI":"10.1515\/jmc-2015-0016"},{"key":"1_CR5","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Holz, T., Savage, S. (eds.) USENIX Security 2016: 25th USENIX Security Symposium, pp. 327\u2013343. USENIX Association, Austin (2016). https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48797-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Bai","year":"2015","unstructured":"Bai, S., Langlois, A., Lepoint, T., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 3\u201324. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_1"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296(1), 625\u2013635 (1993). https:\/\/doi.org\/10.1007\/bf01445125","DOI":"10.1007\/bf01445125"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0V. Lecture Notes in Computer Science, vol. 14085, pp. 358\u2013389. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12","DOI":"10.1007\/978-3-031-38554-4_12"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 93: 1st Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, Fairfax (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"1_CR12","unstructured":"Bernstein, D.J.: Multi-ciphertext security degradation for lattices. Cryptology ePrint Archive, Report 2022\/1580 (2022). https:\/\/eprint.iacr.org\/2022\/1580"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Beullens, W.: Breaking rainbow takes a weekend on a laptop. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13508, pp. 464\u2013479. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_16","DOI":"10.1007\/978-3-031-15979-4_16"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0V. Lecture Notes in Computer Science, vol. 14008, pp. 423\u2013447. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Cremers, C., D\u00fczl\u00fc, S., Fiedler, R., Fischlin, M., Janson, C.: BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures. In: 2021 IEEE Symposium on Security and Privacy, pp. 1696\u20131714. IEEE Computer Society Press, San Francisco (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00093","DOI":"10.1109\/SP40001.2021.00093"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Dadush, D., Regev, O., Stephens-Davidowitz, N.: On the closest vector problem with a distance guarantee. In: Proceedings of the 2014 IEEE 29th Conference on Computational Complexity, CCC \u201914, pp. 98\u2013109. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/CCC.2014.18","DOI":"10.1109\/CCC.2014.18"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Ducas, L., Espitau, T., Postlethwaite, E.W.: Finding short integer solutions when the modulus is small. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0III. Lecture Notes in Computer Science, vol. 14083, pp. 150\u2013176. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_6","DOI":"10.1007\/978-3-031-38548-3_6"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-45608-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_2"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Ducas, L., Prest, T.: Fast Fourier orthogonalization. In: Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, ISSAC \u201916, pp. 191\u2013198. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2930889.2930923","DOI":"10.1145\/2930889.2930923"},{"key":"1_CR22","unstructured":"Ducas, L.: Leaky LWE estimator (2020). https:\/\/github.com\/lducas\/leaky-LWE-Estimator. commit: 0a9caf8bf0f80097724e0c6147194c52c6b90f86"},{"key":"1_CR23","unstructured":"D\u00fczl\u00fc, S., Fiedler, R., Fischlin, M.: BUFFing FALCON without increasing the signature size. Cryptology ePrint Archive, Report 2024\/710 (2024). https:\/\/eprint.iacr.org\/2024\/710"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Espitau, T., et al.: Mitaka: a simpler, parallelizable, maskable variant of falcon. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0III. Lecture Notes in Computer Science, vol. 13277, pp. 222\u2013253. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_9","DOI":"10.1007\/978-3-031-07082-2_9"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Espitau, T., Nguyen, T.T.Q., Sun, C., Tibouchi, M., Wallet, A.: Antrag: annular NTRU trapdoor generation - making mitaka as secure as falcon. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02023, Part\u00a0VII. Lecture Notes in Computer Science, vol. 14444, pp. 3\u201336. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_1","DOI":"10.1007\/978-981-99-8739-9_1"},{"key":"1_CR26","unstructured":"Espitau, T., Niot, G., Sun, C., Tibouchi, M.: SQUIRRELS\u2014Square Unstructured Integer Euclidean Lattice Signature. Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"1_CR27","unstructured":"Fallahpour, P., Fehr, S., Huang, Y.H.: Tighter quantum security for Fiat-Shamir-with-aborts and hash-and-sign-with-retry signatures. Cryptology ePrint Archive, Report 2025\/985 (2025). https:\/\/eprint.iacr.org\/2025\/985"},{"key":"1_CR28","unstructured":"Fouque, P.A., Gajland, P., de\u00a0Groote, H., Janneck, J., Kiltz, E.: A closer look at falcon. Cryptology ePrint Archive, Paper 2024\/1769 (2024). https:\/\/eprint.iacr.org\/2024\/1769"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Gajland, P., Janneck, J., Kiltz, E.: Ring signatures for deniable AKEM: Gandalf\u2019s fellowship. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0I. Lecture Notes in Computer Science, vol. 14920, pp. 305\u2013338. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_10","DOI":"10.1007\/978-3-031-68376-3_10"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. ACM Press, Victoria (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"issue":"4","key":"1_CR31","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"J Hoffstein","year":"2003","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_9"},{"key":"1_CR33","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":"1_CR34","unstructured":"H\u00fclsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"1_CR35","unstructured":"Kimball, K.: Announcing request for nominations for public-key post-quantum cryptographic algorithms. Technical report, National Institute of Standards and Technology (2016). https:\/\/www.federalregister.gov\/d\/2016-30615"},{"key":"1_CR36","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: Shmoys, D.B. (ed.) 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937\u2013941. ACM-SIAM, San Francisco (2000)"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-21568-2_6","volume-title":"Applied Cryptography and Network Security","author":"X Lu","year":"2019","unstructured":"Lu, X., Au, M.H., Zhang, Z.: Raptor: a practical lattice-based (linkable) ring signature. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 110\u2013130. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_6"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"1_CR39","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144\u2013155. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_13"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0V. Lecture Notes in Computer Science, vol. 14008, pp. 448\u2013471. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: 45th Annual Symposium on Foundations of Computer Science, pp. 372\u2013381. IEEE Computer Society Press, Rome (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","DOI":"10.1137\/S0097539705447360"},{"key":"1_CR45","unstructured":"Pornin, T.: Falcon on ARM cortex-m4: an update. Cryptology ePrint Archive, Paper 2025\/123 (2025). https:\/\/eprint.iacr.org\/2025\/123"},{"key":"1_CR46","unstructured":"Pornin, T.: Fn-dsa (in c) (2025). https:\/\/github.com\/pornin\/c-fn-dsa. commit: 1cdc9c5bdd5b5894475febd7e23abbcb5056197b"},{"key":"1_CR47","unstructured":"Pornin, T.: Pqc-forum: constant time digital signature algorithm. Google Groups (2025). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/i38i7t950Cw\/m\/TanXQ30xAQAJ"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-030-17259-6_17","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"T Pornin","year":"2019","unstructured":"Pornin, T., Prest, T.: More efficient algorithms for the NTRU key generation using the field norm. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 504\u2013533. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_17"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/11496137_10","volume-title":"Applied Cryptography and Network Security","author":"T Pornin","year":"2005","unstructured":"Pornin, T., Stern, J.P.: Digital signatures do not guarantee exclusive ownership. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 138\u2013150. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_10"},{"key":"1_CR50","unstructured":"Prest, T.: Gaussian sampling in lattice-based cryptography. Ph.D. thesis, Ecole normale sup\u00e9rieure-ENS PARIS (2015)"},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-70694-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T Prest","year":"2017","unstructured":"Prest, T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 347\u2013374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_13"},{"key":"1_CR52","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"1_CR53","unstructured":"Prest, T., et al.: FALCON. Technical report. National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"1_CR54","unstructured":"R\u00e9nyi, A.: On measures of entropy and information. In: Proceedings of 4th Berkeley Symposium Mathematics and Statistics Probability, vol. 1, pp. 547\u2013561 (1961)"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0V. Lecture Notes in Computer Science, vol. 14008, pp. 472\u2013503. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-78381-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Rosca","year":"2018","unstructured":"Rosca, M., Stehl\u00e9, D., Wallet, A.: On the ring-LWE and polynomial-LWE problems. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 146\u2013173. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_6"},{"key":"1_CR57","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-26059-4_23","volume-title":"Provable Security","author":"K Takashima","year":"2015","unstructured":"Takashima, K., Takayasu, A.: Tighter security for efficient lattice cryptography via the R\u00e9nyi Divergence of optimized orders. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 412\u2013431. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26059-4_23"},{"key":"1_CR60","doi-asserted-by":"publisher","unstructured":"Yu, Y., Jia, H., Wang, X.: Compact lattice gadget and its applications to hash-and-sign signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0V. Lecture Notes in Computer Science, vol. 14085, pp. 390\u2013420. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_13","DOI":"10.1007\/978-3-031-38554-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25327-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:36:42Z","timestamp":1778085402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25327-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253262","9783032253279"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25327-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}