{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:17:54Z","timestamp":1774271874161,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"EU","award":["101128029"],"award-info":[{"award-number":["101128029"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-025-00512-z","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:44:33Z","timestamp":1767865473000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Message recovery attack in NTRU through VFK lattices"],"prefix":"10.1007","volume":"63","author":[{"given":"Eirini D.","family":"Poimenidou","sequence":"first","affiliation":[]},{"given":"Marios","family":"Adamoudis","sequence":"additional","affiliation":[]},{"given":"K. A.","family":"Draziotis","sequence":"additional","affiliation":[]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"512_CR1","doi-asserted-by":"crossref","unstructured":"Adamoudis, M., Draziotis, K.A., Poulakis, D.: Enhancing a DSA attack, CAI 2019, p. 13-25. LNCS 11545, Springer (2019)","DOI":"10.1007\/978-3-030-21363-3_2"},{"key":"512_CR2","doi-asserted-by":"publisher","unstructured":"Adamoudis, M., Draziotis, K.A.: Message recovery attack on NTRU using a lattice independent from the public key. Adv. Math. Commun. (2025). https:\/\/doi.org\/10.3934\/amc.2023040. https:\/\/arxiv.org\/abs\/2203.09620","DOI":"10.3934\/amc.2023040"},{"key":"512_CR3","doi-asserted-by":"publisher","unstructured":"Adamoudis, M., Draziotis, K.A., Poulakis, D.: Attacking (EC) DSA scheme with ephemeral keys sharing specific bits, Theoretical Computer Science, Vol. 1001, June 2024, Elsevier (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114578. https:\/\/arxiv.org\/abs\/2307.03979","DOI":"10.1016\/j.tcs.2024.114578"},{"key":"512_CR4","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions. CRYPTO 2016. LNCS 9814, Springer (2016)","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"512_CR5","doi-asserted-by":"publisher","unstructured":"Alekhnovich, M., Khot, S.A., Kindler, G., Vishnoi, N.K.: Hardness of approximating the closest vector problem with pre-processing, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), Pittsburgh, PA. USA (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.40","DOI":"10.1109\/SFCS.2005.40"},{"issue":"6","key":"512_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3476799","volume":"20","author":"F Aydin","year":"2021","unstructured":"Aydin, F., Aysu, A., Tiwari, M., Gerstlauer, A., Orshansky, M.: Horizontal Side-Channel Vulnerabilities of Post-Quantum Key Exchange and Encapsulation Protocols. ACM Trans. Embedded Comput. Syst. 20(6), 1\u201322 (2021). https:\/\/doi.org\/10.1145\/3476799","journal-title":"ACM Trans. Embedded Comput. Syst."},{"key":"512_CR7","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU Prime: Reducing Attack Surface at Low Cost. In: Adams, C., Camenisch, J. (eds) Selected Areas in Cryptography \u2013 SAC 2017. SAC 2017. LNCS vol 10719. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-72565-9_12","DOI":"10.1007\/978-3-319-72565-9_12"},{"key":"512_CR8","unstructured":"Bernstein, D.J., Brumley, B.B., Chen, M.S., Chuengsatiansup, C., Lange, T., Marotzke, A., Peng, B.Y., Tuveri, N., van Vredendaal, C., Yang, B.Y.: NTRU - Prime Algorithm Specifications And Supporting Documentation (2020)"},{"issue":"3","key":"512_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1515\/JMC.2009.011","volume":"3","author":"G Bourgeois","year":"2009","unstructured":"Bourgeois, G., Faug\u00e8re, J.C.: Algebraic attack on NTRU using Witt vectors and Gr\u00f6bner bases. J. Math. Cryptol. 3(3), 205\u2013214 (2009)","journal-title":"J. Math. Cryptol."},{"key":"512_CR10","unstructured":"Chen, C., Danba, O., Hofstein, J., H\u00fclsing, A., Rijneveld, J., Schanck, J.M., Saito, T., Schwabe, P., Whyte, W., Xagawa, K., Yamakawa, T., Zhang, Z.: NTRU - Algorithm Specifications And Supporting Documentation (2020)"},{"key":"512_CR11","unstructured":"Cheon, J.H., Jeong, J., Lee, C.: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without an encoding of zero. Cryptology ePrint Archive, Report 2016\/139 (2016). https:\/\/eprint.iacr.org\/2016\/139.pdf"},{"key":"512_CR12","doi-asserted-by":"publisher","unstructured":"Conway, J., Sloane, N.: Low-Dimensional Lattices VI: Voronoi Reduction of Three-Dimensional Lattices. Proceedings of The Royal Society A Mathematical Physical and Engineering Sciences 436 (2001). https:\/\/doi.org\/10.1098\/rspa.1992.0004","DOI":"10.1098\/rspa.1992.0004"},{"key":"512_CR13","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Shamir, A.: Lattice Attacks on NTRU. Eurocrypt LNCS 1223, Springer (1997)","DOI":"10.1007\/3-540-69053-0_5"},{"key":"512_CR14","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press (2001). ISBN: 0262032937"},{"key":"512_CR15","unstructured":"Dantzig, G.B., Fulkerson, D.R.: On the max-flow min-cut theorem of networks, CA: RAND Corporation (1955). https:\/\/www.rand.org\/pubs\/papers\/P826.html"},{"key":"512_CR16","doi-asserted-by":"publisher","unstructured":"Ford, L., Fulkerson, D.: Maximal Flow Through a Network. Canadian J. Math., vol.8, Canadian Mathematical Society (1956). https:\/\/doi.org\/10.4153\/CJM-1956-045-5","DOI":"10.4153\/CJM-1956-045-5"},{"key":"512_CR17","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: New Chosen-Ciphertext Attacks on NTRU. Public Key Cryptography \u2013 PKC 2007, LNCS 4450, Springer (2007)","DOI":"10.1007\/978-3-540-71677-8_7"},{"key":"512_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Key recovery and message attacks on NTRU-composite, EUROCRYPT 2001, LNCS 2045, Springer (2001)","DOI":"10.1007\/3-540-44987-6_12"},{"key":"512_CR19","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem, in Proceedings of ANTS \u201998, LNCS 1423, p. 267\u2013288, Springer (1998)","DOI":"10.1007\/BFb0054868"},{"key":"512_CR20","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"NA Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.A., Smart, N.P.: Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptogr. 23, 283\u2013290 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"512_CR21","unstructured":"Howgrave-Graham, N.: A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. CRYPTO 2007, LNCS 4622, Springer (2007)"},{"key":"512_CR22","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: Meet-in-the-middle Attack on an NTRU private key, Technical report, NTRU Cryptosystems, (2006). Report 04, available at http:\/\/www.ntru.com"},{"key":"512_CR23","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Rijneveld, J., Schanck, J., J, Schwabe, P.: High-Speed Key Encapsulation from NTRU. In: Fischer, W., Homma, N. (eds) Cryptographic Hardware and Embedded Systems \u2013 CHES 2017. CHES (2017). Lecture Notes in Computer Science(), vol. 10529. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-66787-4_12","DOI":"10.1007\/978-3-319-66787-4_12"},{"key":"512_CR24","doi-asserted-by":"publisher","unstructured":"Kamal, A.A., Youssef, A.M.: A Scan-Based Side Channel Attack on the NTRUEncrypt Cryptosystem, ARES \u201912: Proceedings of the 2012 Seventh International Conference on Availability, Reliability and Security, (2012), p. 402\u2013409, https:\/\/doi.org\/10.1109\/ARES.2012.14","DOI":"10.1109\/ARES.2012.14"},{"key":"512_CR25","doi-asserted-by":"publisher","unstructured":"Karabulut, E., Alkim, E., Aysu, A.: Single-Trace Side-Channel Attacks $$\\omega $$-Small Polynomial Sampling: With Applications to NTRU, NTRU Prime, and CRYSTALS-DILITHIUM. IEEE International Symposium on Hardware Oriented Security and Trust (HOST). Tysons Corner, VA, USA 2021, 35\u201345 (2021). https:\/\/doi.org\/10.1109\/HOST49136.2021.9702284","DOI":"10.1109\/HOST49136.2021.9702284"},{"key":"512_CR26","doi-asserted-by":"publisher","unstructured":"Kirshanova, E., May, A., Nowakowski, J.: New NTRU Records with. Improved Lattice Bases. PQCrypto 2023, LNCS 14154 (2023) https:\/\/doi.org\/10.1007\/978-3-031-40003-2_7","DOI":"10.1007\/978-3-031-40003-2_7"},{"key":"512_CR27","unstructured":"May, A.: Cryptanalysis of NTRU (preprint) (1999). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.41.3484"},{"key":"512_CR28","doi-asserted-by":"crossref","unstructured":"May, A., Nowakowski, J.: Too Many Hints \u2013 When LLL Breaks LWE (2023) https:\/\/eprint.iacr.org\/2023\/777.pdf","DOI":"10.1007\/978-981-99-8730-6_4"},{"issue":"3","key":"512_CR29","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/140952806","volume":"28","author":"RG McKilliam","year":"2014","unstructured":"McKilliam, R.G., Grant, A., Clarkson, I.V.L.: Finding a closest point in a lattice of Voronoi\u2019s first kind. SIAM J. Discrete Math. 28(3), 1405\u20131422 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"512_CR30","doi-asserted-by":"publisher","unstructured":"McKilliam, R.G., Grant, A.: Finding short vectors in a lattice of Voronoi\u2019s first kind,: IEEE International Symposium on Information Theory Proceedings. Cambridge, MA, USA 2012, 2157\u20132160 (2012). https:\/\/doi.org\/10.1109\/ISIT.2012.6283833","DOI":"10.1109\/ISIT.2012.6283833"},{"key":"512_CR31","unstructured":"Nguyen, P.Q.: Boosting the Hybrid Attack on NTRU: Torus LSH, Permuted HNF and Boxed Sphere, Third PQC Standardization Conference (2021)"},{"key":"512_CR32","unstructured":"OPENSSH 9.0, https:\/\/www.openssh.com\/txt\/release-9.0"},{"key":"512_CR33","doi-asserted-by":"publisher","unstructured":"Picard, J., Ratliff, H.D.: Minimum cuts and related problems. Networks, 5(4) 357\u2013370, Wiley (1975). https:\/\/doi.org\/10.1002\/net.3230050405","DOI":"10.1002\/net.3230050405"},{"key":"512_CR34","doi-asserted-by":"crossref","unstructured":"Saito, T., Xagawa, K., Yamakawa, T.: Tightly-secure key-encapsulation mechanism in the quantum random oracle model. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 520\u2013551. Springer (2018)","DOI":"10.1007\/978-3-319-78372-7_17"},{"issue":"77","key":"512_CR35","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1515\/crll.1874.77.143","volume":"1874","author":"E Selling","year":"1874","unstructured":"Selling, E.: Ueber die bin\u00e4ren und tern\u00e4ren quadratischen Formen. J. Reine Angew. Math. 1874(77), 143\u2013229 (1874). https:\/\/doi.org\/10.1515\/crll.1874.77.143","journal-title":"J. Reine Angew. Math."},{"key":"512_CR36","unstructured":"Silverman, J. H.: Dimension-Reduced Lattices, Zero-Forced Lattices, and the NTRU Public Key Cryptosystem. Technical Report 13, Version 1, NTRU Cryptosystems (1999)"},{"key":"512_CR37","doi-asserted-by":"crossref","unstructured":"Silverman, H., Smart, N.P., Vercauteren, F.: An algebraic approach to NTRU ($$q = 2n$$) via Witt vectors and overdetermined systems of non linear equations. Security in Communication Networks \u2013 SCN 2004, LNCS 3352, p. 278\u2013298. Springer (2005)","DOI":"10.1007\/978-3-540-30598-9_20"},{"key":"512_CR38","unstructured":"Vizev, N.V.: Side Channel Attacks on NTRUEncrypt, Bachelor Thesis, University of Technology Darmstadt, Department of Computer Science (2007)"},{"key":"512_CR39","doi-asserted-by":"crossref","unstructured":"Voronoi, G.: Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. deuxi\u00e8me m\u00e9moire. Recherches sur les parall\u00e9llo\u00e8dres primitifs., J. reine angew. Math. 134, 198\u2013287 (1908)","DOI":"10.1515\/crll.1908.134.198"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00512-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:25:46Z","timestamp":1774268746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00512-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["512"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00512-z","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"21 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"1"}}