{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:49:07Z","timestamp":1770140947761,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T00:00:00Z","timestamp":1714780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T00:00:00Z","timestamp":1714780800000},"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":["Iran J Comput Sci"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s42044-024-00184-x","type":"journal-article","created":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T03:27:35Z","timestamp":1714793255000},"page":"515-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Attack on lattice shortest vector problem using K-Nearest Neighbour"],"prefix":"10.1007","volume":"7","author":[{"given":"Shaurya Pratap","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brijesh Kumar","family":"Chaurasia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanmay","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayush","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddharth","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,4]]},"reference":[{"issue":"56","key":"184_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/cryptography6040056","volume":"6","author":"H Bandara","year":"2022","unstructured":"Bandara, H., Herath, Y., Weerasundara, T., Alawatugoda, J.: On advances of lattice-based cryptographic schemes and their implementations. Cryptography 6(56), 1\u201322 (2022). https:\/\/doi.org\/10.3390\/cryptography6040056","journal-title":"Cryptography"},{"key":"184_CR2","doi-asserted-by":"crossref","unstructured":"Sood, N.: Cryptography in Post Quantum Computing Era. (2024). Online available at: https:\/\/www.researchgate.net\/publication\/377696294_Cryptography_in_Post_Quantum_Computing_Era. Accessed 22 Janu 2024","DOI":"10.2139\/ssrn.4705470"},{"key":"184_CR3","doi-asserted-by":"publisher","unstructured":"Stanley, M., Gui, Y., Unnikrishnan, D., Hall, S.R.G., Fatadin, I.: Recent progress in quantum key distribution network deployments and standards. In: National Physical Laboratory Joint Symposium on Quantum Technologies, Journal of Physics: Conference Series. 2416: 1-14 (2022). https:\/\/doi.org\/10.1088\/1742-6596\/2416\/1\/012001","DOI":"10.1088\/1742-6596\/2416\/1\/012001"},{"key":"184_CR4","doi-asserted-by":"publisher","unstructured":"Singh, A., Padhye, S.: A lattice-based key exchange protocol over NTRU-NIP. In: Roy, B.K., Chaturvedi, A., Tsaban, B., Hasan, S.U. (eds) Cryptology and Network Security with Machine Learning. ICCNSML 2022. Algorithms for Intelligent Systems. Springer, Singapore, 325\u2013334 (2023). https:\/\/doi.org\/10.1007\/978-981-99-2229-1_27","DOI":"10.1007\/978-981-99-2229-1_27"},{"key":"184_CR5","doi-asserted-by":"publisher","first-page":"190475","DOI":"10.1109\/ACCESS.2020.3031276","volume":"8","author":"Z Sun","year":"2020","unstructured":"Sun, Z., Gu, C., Zheng, Y.: A review of sieve algorithms in solving the shortest lattice vector problem. In IEEE Access 8, 190475\u2013190486 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3031276","journal-title":"In IEEE Access"},{"issue":"4","key":"184_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"184_CR7","doi-asserted-by":"publisher","unstructured":"Lagarias, J.C.: Knapsack public key cryptosystems and diophantine approximation. In: Advances in Cryptology, 3\u201323 (1983). https:\/\/doi.org\/10.1007\/978-1-4684-4730-9_1","DOI":"10.1007\/978-1-4684-4730-9_1"},{"key":"184_CR8","unstructured":"Micciancio, D., Regev, O. Lattice-based Cryptography, pp. 1\u201333, Online available at: https:\/\/cims.nyu.edu\/~regev\/papers\/pqc.pdf (2008). Accessed 8 Feb 2024"},{"key":"184_CR9","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-981-15-8427-5","volume-title":"Lattice-Based Cryptosystems-A Design Perspective","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Zhang, Z.: Lattice-Based Cryptosystems-A Design Perspective, vol. XIII, p. 174. Springer Singapore (2020)"},{"issue":"56","key":"184_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/cryptography6040056","volume":"6","author":"H Bandara","year":"2022","unstructured":"Bandara, H., Herath, Y., Weerasundara, T., Alawatugoda, J.: On advances of lattice-based cryptographic schemes and their implementations. Cryptography MDPI. 6(56), 1\u201322 (2022). https:\/\/doi.org\/10.3390\/cryptography6040056","journal-title":"Cryptography MDPI."},{"key":"184_CR11","doi-asserted-by":"publisher","unstructured":"Singh, S.P., Chaurasia, B.K., Pal, A., Gupta, S., Tripathi, T.: Lattice reduction using K-means algorithm. EAI Endorsed Trans. Scalable Inf. Syst. 1\u201311 (2024). https:\/\/doi.org\/10.4108\/eetsis.339492","DOI":"10.4108\/eetsis.339492"},{"key":"184_CR12","doi-asserted-by":"publisher","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: K. G. Paterson (Ed.),\u00a0Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings 6632: 27\u201347, (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"184_CR13","doi-asserted-by":"publisher","unstructured":"Guo, G., Wang, H., Bell, D., Bi, Y., Greer, K.: KNN model-based approach in classification. In: Lecture Notes in Computer Science, pp. 986\u2013996 (2023). https:\/\/doi.org\/10.1007\/978-3-540-39964-3_62","DOI":"10.1007\/978-3-540-39964-3_62"},{"key":"184_CR14","unstructured":"Cunningham, P., Delany, S.J.: k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples), Online available at: https:\/\/arxiv.org\/pdf\/2004.04523.pdf. (2020). Accessed 8 Feb 2024"},{"key":"184_CR15","unstructured":"Li, J., Nguyen, P.Q.: A complete analysis of the BKZ lattice reduction algorithm, 1\u201345, Online available at: https:\/\/eprint.iacr.org\/2020\/1237.pdf. Accessed 29 Mar 2023"},{"issue":"3","key":"184_CR16","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/21.57285","volume":"20","author":"G Parthasarathy","year":"1990","unstructured":"Parthasarathy, G., Chatterji, B.N.: A class of new KNN methods for low sample problems. In IEEE Trans. Syst. Man Cybern. 20(3), 715\u2013718 (1990). https:\/\/doi.org\/10.1109\/21.57285","journal-title":"In IEEE Trans. Syst. Man Cybern."},{"key":"184_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","volume":"41","author":"B Helfrich","year":"1985","unstructured":"Helfrich, B.: Algorithms to construct Minkowski reduced and hermite reduced lattice bases. Theoret. Comput. Sci.. Comput. Sci. 41, 125\u2013139 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90067-2","journal-title":"Theoret. Comput. Sci.. Comput. Sci."},{"key":"184_CR18","first-page":"1","volume-title":"Linear Regression Analysis","author":"AF Seber","year":"2023","unstructured":"Seber, A.F., Lee, A.J.: Linear Regression Analysis, pp. 1\u2013583. Wiley (2023)"},{"issue":"15","key":"184_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s44147-023-00348-9","volume":"71","author":"M Duan","year":"2024","unstructured":"Duan, M.: Innovative compressive strength prediction for recycled aggregate\/concrete using K-nearest neighbors and meta-heuristic optimization approaches. J. Eng. Appl. Sci. 71(15), 1\u201316 (2024). https:\/\/doi.org\/10.1186\/s44147-023-00348-9","journal-title":"J. Eng. Appl. Sci."},{"key":"184_CR20","unstructured":"Python Language, Online available at: https:\/\/www.python.org\/. Accessed 29 Mar 2023"}],"container-title":["Iran Journal of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-024-00184-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42044-024-00184-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-024-00184-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T09:19:34Z","timestamp":1726737574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42044-024-00184-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,4]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["184"],"URL":"https:\/\/doi.org\/10.1007\/s42044-024-00184-x","relation":{},"ISSN":["2520-8438","2520-8446"],"issn-type":[{"value":"2520-8438","type":"print"},{"value":"2520-8446","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,4]]},"assertion":[{"value":"10 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2024","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 work is not submitted in any other journal. There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}