{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:10:04Z","timestamp":1778213404340,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032236036","type":"print"},{"value":"9783032236043","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-23604-3_9","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:17:27Z","timestamp":1778210247000},"page":"133-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Domain-Informed Representation for\u00a0Evolutionary Sieving in\u00a0Integral and\u00a0Module Lattices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4301-6923","authenticated-orcid":false,"given":"Ahmad","family":"Tashfeen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4336-3082","authenticated-orcid":false,"given":"Qi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"issue":"10","key":"9_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.14569\/IJACSA.2024.0151076","volume":"15","author":"O Abramkina","year":"2024","unstructured":"Abramkina, O., Yakubova, M., Serikov, T., Begimbayeva, Y., Yakubov, B.: Implementation of lattice theory into the tls to ensure secure traffic transmission in ip networks based on ip pbx asterisk. Int. J. Adv. Comput. Sci. Appl. 15(10), 22 (2024). https:\/\/doi.org\/10.14569\/IJACSA.2024.0151076","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"9_CR2","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":"9_CR3","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the second round of the nist post-quantum cryptography standardization process. US Department of Commerce, NIST (July 2020). https:\/\/csrc.nist.gov\/pubs\/ir\/8309\/final","DOI":"10.6028\/NIST.IR.8240"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the first round of the nist post-quantum cryptography standardization process. US Department of Commerce, NIST (January 2019). https:\/\/csrc.nist.gov\/pubs\/ir\/8240\/final","DOI":"10.6028\/NIST.IR.8240"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the third round of the nist post-quantum cryptography standardization process. US Department of Commerce, NIST (July 2022). https:\/\/csrc.nist.gov\/pubs\/ir\/8413\/upd1\/final","DOI":"10.6028\/NIST.IR.8413"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the fourth round of the nist post-quantum cryptography standardization process. US Department of Commerce, NIST (March 2025). https:\/\/csrc.nist.gov\/pubs\/ir\/8545\/final","DOI":"10.6028\/NIST.IR.8545"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lov\u00e1sz\u2019lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Balny, S., Delaplace, C., Dequen, G.: Another l makes it better? lagrange meets lll and may improve bkz pre-processing. In: 2025 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 181\u2013193. SIAM (2025)","DOI":"10.1137\/1.9781611978339.15"},{"key":"9_CR9","unstructured":"de\u00a0Boer, K., van Woerden, W.: Lattice-based cryptography: a survey on the security of the lattice-based NIST finalists. Cryptology ePrint Archive, Paper 2025\/304 (2025). https:\/\/eprint.iacr.org\/2025\/304"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bosman, P.A., Luong, N.H., Thierens, D.: Expanding from discrete cartesian to permutation gene-pool optimal mixing evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 637\u2013644 (2016)","DOI":"10.1145\/2908812.2908917"},{"key":"9_CR11","unstructured":"of\u00a0Commerce, USD: Federal register\/notices. Notice and request for nominations for candidate postquantum algorithms.\u00a0244, National Institute of Standards and Technology (December 2016). https:\/\/www.federalregister.gov\/d\/2016-30615"},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"crossref","unstructured":"Goldman, B.W., Punch, W.F.: Parameter-less population pyramid. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation. pp. 785\u2013792 (2014)","DOI":"10.1145\/2576768.2598350"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H., Silverman, J.H.: An introduction to mathematical cryptography, vol.\u00a01, pp. 436, 377, 402, 405. Springer (2008). https:\/\/doi.org\/10.1007\/978-0-387-77993-5","DOI":"10.1007\/978-0-387-77993-5"},{"key":"9_CR15","unstructured":"Kalbach, A., Chinburg, T.: Lll algorithm for lattice basis reduction. arXiv preprint arXiv:2410.22196 (2024)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013104. Plenum, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Laarhoven, T.: Evolutionary techniques in lattice sieving algorithms. In: Proceedings of the 11th International Joint Conference on Computational Intelligence, IJCCI 2019, pp. 31\u201339. SCITEPRESS - Science and Technology Publications, Lda, Setubal, PRT (2019). https:\/\/doi.org\/10.5220\/0007968800310039","DOI":"10.5220\/0007968800310039"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM (JACM) 32(1), 229\u2013246 (1985)","journal-title":"J. ACM (JACM)"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Lidl, R., Pilz, G.: Applications of Lattices, pp. 56\u2013119. Springer US, New York (1984). https:\/\/doi.org\/10.1007\/978-1-4615-6465-2_2","DOI":"10.1007\/978-1-4615-6465-2_2"},{"key":"9_CR20","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsacks. In: Secure Communications and Asymmetric Cryptosystems, pp. 197\u2013215. Routledge (2019)"},{"key":"9_CR21","unstructured":"Nguyen, G.N.: Shortest vector problem challenge (darmstadt lattice challenge) (2025). https:\/\/www.latticechallenge.org\/svp-challenge\/, Accessed 06 Feb 2025"},{"key":"9_CR22","unstructured":"Pass, R.: Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on np-hardness. In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), pp. 13\u2013pp. IEEE (2006)"},{"key":"9_CR23","unstructured":"Russell, S.J., Norvig, P.: Artificial intelligence: a modern approach, p.\u00a0129. Pearson (2016)"},{"key":"9_CR24","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. IEEE Access 8, 190475\u2013190486 (2020)","journal-title":"IEEE Access"},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"362","DOI":"10.46586\/tches.v2025.i2.362-384","volume":"2025","author":"Z Zhao","year":"2025","unstructured":"Zhao, Z., Ding, J., Yang, B.Y.: Sieving with streaming memory access. IACR Trans. Cryptographic Hardware Embedded Syst. 2025(2), 362\u2013384 (2025)","journal-title":"IACR Trans. Cryptographic Hardware Embedded Syst."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-23604-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:17:37Z","timestamp":1778210257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23604-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032236036","9783032236043"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23604-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors\u00a0have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}