{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T10:40:02Z","timestamp":1750848002058,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819687305","type":"print"},{"value":"9789819687312","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-8731-2_38","type":"book-chapter","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:59:14Z","timestamp":1750845554000},"page":"398-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A PSO-Based Method for Finding Approximately Optimal Order for LLL Algorithm"],"prefix":"10.1007","author":[{"given":"Xin","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiqi","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruoting","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianghan","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,21]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Introduction to post-quantum cryptography, pp. 1\u201314. Springer Heidelberg (2009)","DOI":"10.1007\/978-3-540-88702-7_1"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within mordell\u2019s inequality. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, p. 207\u2013216. STOC \u201908, Association for Computing Machinery, New York (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks. vol.\u00a04, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"38_CR7","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.M.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"May, A.: Using LLL-Reduction for Solving RSA and Factorization Problems, pp. 315\u2013348. Springer Heidelberg (2010)","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography, pp. 147\u2013191. Springer Heidelberg (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Morel, I., Stehl\u00e9, D., Villard, G.: H-lll: using householder inside lll. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, p. 271\u2013278. ISSAC \u201909, Association for Computing Machinery, New York (2009)","DOI":"10.1145\/1576702.1576740"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"PQ Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory, pp. 238\u2013256. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in $$\\ell _p$$ norms. In: Twenty-Second Annual IEEE Conference on Computational Complexity (CCC\u201907), pp. 333\u2013346 (2007)","DOI":"10.1109\/CCC.2007.12"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-35999-6_18","volume-title":"Selected Areas in Cryptography","author":"T Plantard","year":"2013","unstructured":"Plantard, T., Susilo, W., Zhang, Z.: Lattice reduction for modular knapsack. In: Knudsen, L.R., Wu, H. (eds.) Selected Areas in Cryptography, pp. 275\u2013286. Springer, Berlin Heidelberg, Berlin, Heidelberg (2013)"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-16761-7_85","volume-title":"Automata, Languages and Programming","author":"CP Schnorr","year":"1986","unstructured":"Schnorr, C.P.: A more efficient algorithm for lattice basis reduction. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 359\u2013369. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16761-7_85"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Fundamentals of Computation Theory","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 68\u201385. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54458-5_51"},{"key":"38_CR16","first-page":"1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201995","author":"CP Schnorr","year":"1995","unstructured":"Schnorr, C.P., H\u00f6rner, H.H.: Attacking the chor-rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.J. (eds.) Advances in Cryptology \u2013 EUROCRYPT \u201995, pp. 1\u201312. Springer, Berlin Heidelberg, Berlin, Heidelberg (1995)"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","volume":"10","author":"TM Shami","year":"2022","unstructured":"Shami, T.M., El-Saleh, A.A., Alswaitti, M., Al-Tashi, Q., Summakieh, M.A., Mirjalili, S.: Particle swarm optimization: a comprehensive survey. IEEE Access 10, 10031\u201310061 (2022)","journal-title":"IEEE Access"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-031-08896-4_8","volume-title":"Information Security and Cryptology - ICISC 2021","author":"K Yamamura","year":"2022","unstructured":"Yamamura, K., Wang, Y., Fujisaki, E.: Improved lattice enumeration algorithms by primal and dual reordering methods. In: Park, J.H., Seo, S.H. (eds.) Information Security and Cryptology - ICISC 2021, pp. 159\u2013174. Springer International Publishing, Cham (2022)"}],"container-title":["Lecture Notes in Computer Science","Wireless Artificial Intelligent Computing Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8731-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:59:17Z","timestamp":1750845557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8731-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819687305","9789819687312"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8731-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Artificial Intelligent Computing Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2025\/index.html#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}