{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:51Z","timestamp":1772240691263,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T00:00:00Z","timestamp":1589328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T00:00:00Z","timestamp":1589328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP17J01987"],"award-info":[{"award-number":["JP17J01987"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003382","name":"Core Research for Evolutional Science and Technology","doi-asserted-by":"publisher","award":["JPMJCR14D6"],"award-info":[{"award-number":["JPMJCR14D6"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10207-020-00501-y","type":"journal-article","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T14:03:04Z","timestamp":1589378584000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Studying lattice reduction algorithms improved by quick reordering technique"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-4508","authenticated-orcid":false,"given":"Yuntao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,13]]},"reference":[{"key":"501_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"501_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E. W., Stevens, M.: The general sieve kernel and new records in lattice reduction. In: Advances in Cryptology\u2014EUROCRYPT 2019\u201438th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part II, pp. 717\u2013746 (2019)","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"501_CR3","unstructured":"Aono, Y.: A faster method for computing Gama\u2013Nguyen\u2013Regev\u2019s extreme pruning coefficients. CoRR, arXiv:1406.0342 (2014)"},{"key":"501_CR4","doi-asserted-by":"crossref","unstructured":"Aono, Y., Nguyen, P.Q.: Random sampling revisited: Lattice enumeration with discrete pruning. In: Advances in Cryptology\u2014EUROCRYPT 2017\u201436th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part II, pp. 65\u2013102 (2017)","DOI":"10.1007\/978-3-319-56614-6_3"},{"key":"501_CR5","doi-asserted-by":"crossref","unstructured":"Aono, Y., Nguyen, P.Q., Seito, T., Shikata, J.: Lower bounds on lattice enumeration with extreme pruning. In: Advances in Cryptology\u2014- CRYPTO 2018\u201438th Annual International Cryptology Conference, Proceedings, Part II, pp. 608\u2013637 (2018)","DOI":"10.1007\/978-3-319-96881-0_21"},{"key":"501_CR6","doi-asserted-by":"crossref","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Advances in Cryptology\u2014EUROCRYPT 2016\u201435th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part I, pp. 789\u2013819 (2016)","DOI":"10.1007\/978-3-662-49890-3_30"},{"key":"501_CR7","doi-asserted-by":"crossref","unstructured":"Bai, S., Stehl\u00e9, D., Wen, W.: Measuring, simulating and exploiting the head concavity phenomenon in BKZ. In: Advances in Cryptology\u2014ASIACRYPT 2018\u2014- 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part I, pp. 369\u2013404 (2018)","DOI":"10.1007\/978-3-030-03326-2_13"},{"key":"501_CR8","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, vol. 2016, pp. 10\u201324 (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"501_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nguyen, P.Q.: Bkz 2.0: better lattice security estimates. In: Advances in Cryptology\u2014ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, pp. 1\u201320 (2011)","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"501_CR10","unstructured":"N.I.o.S. Computer Security\u00a0Division, Information Technology\u00a0Laboratory and U. D. o. C. Technology. Post-quantum cryptography | csrc, (2017)"},{"key":"501_CR11","unstructured":"Darmstadt, T.: Svp challenge (2017). https:\/\/www.latticechallenge.org\/svp-challenge"},{"key":"501_CR12","unstructured":"T. F. development team. fplll, a lattice reduction library (2017). https:\/\/github.com\/fplll\/fplll"},{"issue":"170","key":"501_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comput."},{"key":"501_CR14","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Advances in Cryptology\u2014EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, pp. 31\u201351 (2008)","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"501_CR15","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Advances in Cryptology\u2014EUROCRYPT 2010, Proceedings of 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 257\u2013278 (2010)","DOI":"10.1007\/978-3-642-13190-5_13"},{"issue":"1","key":"501_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"CAR Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Comput. J. 5(1), 10\u201316 (1962)","journal-title":"Comput. J."},{"key":"501_CR17","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Algorithmic Number Theory, Third International Symposium, ANTS-III, Proceedings, pp. 267\u2013288 (1998)","DOI":"10.1007\/BFb0054868"},{"key":"501_CR18","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 193\u2013206 (1983)","DOI":"10.1145\/800061.808749"},{"issue":"177","key":"501_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"501_CR20","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF01442795","volume":"6","author":"A Korkine","year":"1873","unstructured":"Korkine, A., Zolotareff, G.: Sur les forms quadratiques. Math. Ann. 6, 581\u2013583 (1873)","journal-title":"Math. Ann."},{"key":"501_CR21","unstructured":"Lagrange, L.: Recherches d\u2019arithm\u00e9tique. Nouv. M\u00e9m. Acad. (1773)"},{"key":"501_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"501_CR23","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, vol. 2010, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"501_CR24","doi-asserted-by":"crossref","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Advances in Cryptology\u2014CRYPTO\u201985, Proceedings, pp. 417\u2013426 (1985)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"501_CR25","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, pp. 215\u2013233 (2005)","DOI":"10.1007\/11426639_13"},{"key":"501_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Proceedings, pp. 238\u2013256 (2006)","DOI":"10.1007\/11792086_18"},{"issue":"2","key":"501_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2), 181\u2013207 (2008)","journal-title":"J. Math. Cryptol."},{"key":"501_CR28","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"501_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"1","key":"501_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"C Schnorr","year":"1988","unstructured":"Schnorr, C.: A more efficient algorithm for lattice basis reduction. J. Algorithms 9(1), 47\u201362 (1988)","journal-title":"J. Algorithms"},{"key":"501_CR31","doi-asserted-by":"crossref","unstructured":"Schnorr, C.: Lattice reduction by random sampling and birthday methods. In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pp. 145\u2013156 (2003)","DOI":"10.1007\/3-540-36494-3_14"},{"key":"501_CR32","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"501_CR33","doi-asserted-by":"crossref","unstructured":"Schnorr, C., H\u00f6rner, H.H.: Attacking the chor-rivest cryptosystem by improved lattice reduction. In: Advances in Cryptology\u2014EUROCRYPT\u201995, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21\u201325, 1995, Proceeding, pp. 1\u201312 (1995)","DOI":"10.1007\/3-540-49264-X_1"},{"key":"501_CR34","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994)"},{"key":"501_CR35","unstructured":"Shoup, V.: NTL, a library for doing number theory (2017). http:\/\/www.shoup.net\/ntl\/"},{"key":"501_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The Algorithm Design Manual","author":"S Skiena","year":"2008","unstructured":"Skiena, S.: The Algorithm Design Manual, 2nd edn. Springer, Berlin (2008)","edition":"2"},{"key":"501_CR37","doi-asserted-by":"crossref","unstructured":"Wang, Y., Takagi, T.: Improving the BKZ reduction algorithm by quick reordering technique. In: Information Security and Privacy\u201423rd Australasian Conference, ACISP 2018, Proceedings, pp. 787\u2013795 (2018)","DOI":"10.1007\/978-3-319-93638-3_47"},{"key":"501_CR38","doi-asserted-by":"crossref","unstructured":"Yamaguchi, J., Yasuda, M.: Explicit formula for gram-Schmidt vectors in LLL with deep insertions and its applications. In: Number-Theoretic Methods in Cryptology-First International Conference, 2017, Revised Selected Papers, pp. 142\u2013160 (2017)","DOI":"10.1007\/978-3-319-76620-1_9"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00501-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-020-00501-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00501-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T23:58:48Z","timestamp":1620863928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-020-00501-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,13]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10207-020-00501-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,13]]},"assertion":[{"value":"13 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}