{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:05:00Z","timestamp":1757617500384,"version":"3.44.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T00:00:00Z","timestamp":1742256000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T00:00:00Z","timestamp":1742256000000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10623-025-01618-8","type":"journal-article","created":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T01:38:46Z","timestamp":1742261926000},"page":"2695-2716","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An attack on p-adic lattice public-key encryption cryptosystems and signature schemes"],"prefix":"10.1007","volume":"93","author":[{"given":"Chi","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"1618_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai M.: The shortest vector problem in $$l_2$$ is NP-hard for randomized reductions (extended abstract). In: Vitter, J.S. (ed.) Proceedings of the 38th Annual ACM Symposium on the Theory of Computing\u2014STOC, pp. 10\u201319 (1998).","DOI":"10.1145\/276698.276705"},{"key":"1618_CR2","doi-asserted-by":"publisher","unstructured":"Bernstein D.J., H\u00fclsing A., K\u00f6lbl S., Niederhagen R., Rijneveld J., Schwabe P.: The $$\\text{SPHINCS}^{+}$$ Signature framework. In: 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919). ACM, New York (2019). https:\/\/doi.org\/10.1145\/3319535.3363229.","DOI":"10.1145\/3319535.3363229"},{"key":"1618_CR3","doi-asserted-by":"publisher","unstructured":"Bos J., Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., Schanck J.M., Schwabe P., Stehl\u00e9 D.: CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), London, UK, pp. 353\u2013367 (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032.","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"1618_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139171885","volume-title":"Local Fields","author":"JWS Cassels","year":"1986","unstructured":"Cassels J.W.S.: Local Fields. Cambridge University Press, Cambridge (1986)."},{"key":"1618_CR5","unstructured":"Deng Y., Luo L., Xiao G.: On Some Computational Problems in Local Fields. Cryptology ePrint Archive, Report 2018\/1229 (2018). http:\/\/eprint.iacr.org\/2018\/1229."},{"key":"1618_CR6","unstructured":"Deng Y.: On $$p$$-adic gram-Schmidt orthogonalization process. arXiv preprint arXiv:2305.07886 (2023). Frontiers of Mathematics (to appear)."},{"key":"1618_CR7","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s11424-021-0074-8","volume":"35","author":"Y Deng","year":"2022","unstructured":"Deng Y., Luo L., Pan Y., Xiao G.: On some computational problems in local fields. J. Syst. Sci. Complex. 35, 1191\u20131200 (2022).","journal-title":"J. Syst. Sci. Complex."},{"key":"1618_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1134\/S2070046624010035","volume":"16","author":"Y Deng","year":"2024","unstructured":"Deng Y., Luo L., Pan Y., Wang Z., Xiao G.: Public-key cryptosystems and signature schemes from $$p$$-adic lattices. $$p$$-adic numbers. Ultrametr. Anal. Appl. 16, 23\u201342 (2024).","journal-title":"Ultrametr. Anal. Appl."},{"key":"1618_CR9","unstructured":"Ducas L., Lepoint T., Lyubashevsky V., Schwabe P., Seiler G., Stehl\u00e9 D.: CRYSTALS-Dilithium: digital signatures from module lattices. Cryptology ePrint Archive, Paper 2017\/633 (2017). https:\/\/eprint.iacr.org\/2017\/633."},{"key":"1618_CR10","doi-asserted-by":"publisher","unstructured":"Goldreich O., Goldwasser S., Halevi S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski, B.S. (ed.) Advances in Cryptology-CRYPTO\u201997, LNCS, vol. 1294, pp. 112-131 Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052231.","DOI":"10.1007\/BFb0052231"},{"key":"1618_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47295-5","volume-title":"$$p$$-adic Numbers: An Introduction","author":"QF Gouv\u00eaa","year":"2020","unstructured":"Gouv\u00eaa Q.F.: $$p$$-adic Numbers: An Introduction, 3rd edn Springer, Cham (2020).","edition":"3"},{"key":"1618_CR12","first-page":"267","volume-title":"ANTS 1998, LNCS","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)."},{"key":"1618_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic Aspects of Cryptography","author":"N Koblitz","year":"1998","unstructured":"Koblitz N.: Algebraic Aspects of Cryptography. Springer, Berlin (1998)."},{"key":"1618_CR14","unstructured":"PQC Project. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography. Last accessed 8 May 2024."},{"key":"1618_CR15","unstructured":"Prest T., Fouque P.A., Hoffstein J., Kirchner P., Lyubashevsky V., Pornin T., Ricosset T., Seiler G., Whyte W., Zhang Z.: Falcon: fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s post-quantum cryptography standardization process (2020)."},{"issue":"6","key":"1618_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009).","journal-title":"J. ACM"},{"key":"1618_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3254-2","volume-title":"A Course in $$p$$-adic Analysis, GTM 198","author":"AM Robert","year":"2000","unstructured":"Robert A.M.: A Course in $$p$$-adic Analysis, GTM 198. Springer, New York (2000)."},{"key":"1618_CR18","doi-asserted-by":"crossref","unstructured":"Shor P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, pp. 124\u2013134 (1994).","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1618_CR19","unstructured":"van Emde Boas P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical report, University of Amsterdam, Department of Mathematics, Netherlands (1981)."},{"key":"1618_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61945-8","volume-title":"Basic Number Theory","author":"A Weil","year":"1974","unstructured":"Weil A.: Basic Number Theory, 3rd edn Springer, New York (1974).","edition":"3"},{"key":"1618_CR21","unstructured":"Zhang C., Deng Y., Wang Z.: Norm orthogonal bases and invariants of $$p$$-adic lattices. arXiv preprint arXiv: 2311.17415 (2023)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01618-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:42:23Z","timestamp":1757144543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01618-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,18]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1618"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01618-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,3,18]]},"assertion":[{"value":"18 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}