{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:34:14Z","timestamp":1726414454175},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T00:00:00Z","timestamp":1617580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T00:00:00Z","timestamp":1617580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11424-021-0042-3","type":"journal-article","created":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T05:02:46Z","timestamp":1617598966000},"page":"1173-1190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ciphertext-Only Attacks Against Compact-LWE Submitted to NIST PQC Project"],"prefix":"10.1007","volume":"35","author":[{"given":"Haoyu","family":"Li","sequence":"first","affiliation":[]},{"given":"Renzhang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Tianyuan","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,5]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","author":"P W Shor","year":"1994","unstructured":"Shor P W, Algorithms for quantum computation: Discrete logarithms and factoring, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, USA, IEEE, 1994, 124\u2013134."},{"issue":"5","key":"42_CR2","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P W Shor","year":"1997","unstructured":"Shor P W, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 1997, 26(5): 1484\u20131509.","journal-title":"SIAM J. Comput."},{"key":"42_CR3","first-page":"212","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"L K Grover","year":"1996","unstructured":"Grover L K, A fast quantum mechanical algorithm for database search, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Pennsylvania, USA, ACM, 1996, 212\u2013219."},{"key":"42_CR4","first-page":"84","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"O Regev","year":"2005","unstructured":"Regev O, On lattices, learning with errors, random linear codes, and cryptography, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, USA, ACM, 2005, 84\u201393."},{"key":"42_CR5","unstructured":"Liu D X, Li N, Kim J, et al., Compact-LWE: A public key encryption scheme, Round 1 submission for NIST Post-Quantum Cryptography Standardization, available at https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/Compact_LWE.zip, 2017."},{"key":"42_CR6","unstructured":"Liu D X, Li N, Kim J, et al., Compact-LWE: Enabling practically lightweight public key encryption for leveled IoT device authentication, Cryptology ePrint Archive, 2017, Report 2017\/685."},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Bootle J, Tibouchi M, and Xagawa K, Cryptanalysis of compact-LWE, Proceedings of Topics in Cryptology \u2014 CT-RSA 2018 (Ed. by Smart N P), San Francisco, USA, LNCS, Springer Cham, 2018, 10808: 80\u201397.","DOI":"10.1007\/978-3-319-76953-0_5"},{"key":"42_CR8","first-page":"1","volume":"2018","author":"D Y Xiao","year":"2018","unstructured":"Xiao D Y and Yu Y, Cryptanalysis of compact-LWE and related lightweight public key encryption, Security and Communication Networks, 2018, 2018 (Article ID 4957045): 1\u20139.","journal-title":"Security and Communication Networks"},{"key":"42_CR9","unstructured":"Keita X, Tibouchi M, et al., Official comments for Compact-LWE, available at https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/Compact-LWE-official-comment.pdf, 2018."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Ajtai M, The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract), Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, USA, ACM, 1998, 10\u201319.","DOI":"10.1145\/276698.276705"},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A K Lenstra","year":"1982","unstructured":"Lenstra A K, Lenstra H W, and Lov\u00e1sz L, Factoring polynomials with rational coefficients, Mathematische Annalen, 1982, 261(4): 515\u2013534.","journal-title":"Mathematische Annalen"},{"key":"42_CR12","unstructured":"Van Emde Boas P, Another NP-complete problem and the complexity of computing short vectors in lattices, Math. Dept. Report, 81\u201304, Univ. of Amsterdam, 1981."},{"key":"42_CR13","unstructured":"Dinur I, Kindler G, and Safra S, Approximating-CVP to within almost-polynomial factors is NP-hard, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, California, USA, 1998, 99\u2013109."},{"key":"42_CR14","first-page":"13","volume-title":"Proceedings of the 2nd Annual Symposium on Theoretical Aspects of Computer Science","author":"L Babai","year":"1985","unstructured":"Babai L, On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem, Proceedings of the 2nd Annual Symposium on Theoretical Aspects of Computer Science (Ed. by Mehlhorn K), Saarbr\u00fccken, Germany, Springer Berlin Heidelberg, 1985, 13\u201320."},{"key":"42_CR15","first-page":"198","volume-title":"Proceedings of Annual International Cryptology Conference","author":"P Q Nguyen","year":"1997","unstructured":"Nguyen P Q and Stern J, Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations, Proceedings of Annual International Cryptology Conference, Santa Barbara, USA, LNCS, Springer Berlin Heidelberg, 1997, 1294: 198\u2013212."},{"key":"42_CR16","first-page":"197","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"C Gentry","year":"2008","unstructured":"Gentry C, Peikert C, and Vaikuntanathan V, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, Canada, ACM, 2008, 197\u2013206."},{"key":"42_CR17","unstructured":"Shoup V, NTL: A library for doing number theory, version 5.5.2, http:\/\/www.shoup.net\/ntl, 2009."},{"key":"42_CR18","unstructured":"Sage Development Team, Sage Mathematics Software, version 7.5.1, http:\/\/www.sagemath.org, 2017."},{"key":"42_CR19","first-page":"31","volume-title":"Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"N Gama","year":"2008","unstructured":"Gama N and Nguyen P Q, Predicting lattice reduction, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, LNCS, Springer, 2008, 4965: 31\u201351."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-021-0042-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-021-0042-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-021-0042-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T06:15:31Z","timestamp":1656137731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-021-0042-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s11424-021-0042-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"type":"print","value":"1009-6124"},{"type":"electronic","value":"1559-7067"}],"subject":[],"published":{"date-parts":[[2021,4,5]]},"assertion":[{"value":"11 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}