{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:29Z","timestamp":1775774009157,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819744640","type":"print"},{"value":"9789819744657","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-4465-7_12","type":"book-chapter","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T17:01:46Z","timestamp":1720717306000},"page":"167-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting an\u00a0Extension of\u00a0Kannan\u2019s Embedding for\u00a0Ring-LWE"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Uesugi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4130-7366","authenticated-orcid":false,"given":"Shinya","family":"Okumura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8822-5287","authenticated-orcid":false,"given":"Atsuko","family":"Miyaji","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,12]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bos, J.W., et al.: CRYSTALS - kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P 2018), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"12_CR2","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS - dilithium: digital signatures from module lattices. IACR Cryptol. ePrint Arch, p.\u00a0633 (2017)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-54631-0_24","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"T Ishiguro","year":"2014","unstructured":"Ishiguro, T., Kiyomoto, S., Miyake, Y., Takagi, T.: Parallel Gauss Sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 411\u2013428. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_24"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","DOI":"10.1287\/moor.12.3.415"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Annal. 261, 515\u2013534 (1982)","DOI":"10.1007\/BF01457454"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 1\u201335 (2013)","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-Ffirst Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1468\u20131480. SIAM (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Nakamura, S., Yasuda, M.: An extension of Kannan\u2019s embedding for solving ring-based IWE problems. In: Cryptography and Coding: 18th IMA International Conference, IMACC 2021, Virtual Event, 14\u201315 December 2021, Proceedings 18, pp. 201\u2013219. Springer (2021)","DOI":"10.1007\/978-3-030-92641-0_10"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Pornin, T., Prest, T.: More efficient algorithms for the NTRU key generation using the field norm. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 504\u2013533. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_17","DOI":"10.1007\/978-3-030-17259-6_17"},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Schneider, M.: Sieving for shortest vectors in ideal lattices. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 375\u2013391. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_22","DOI":"10.1007\/978-3-642-38553-7_22"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"12_CR14","unstructured":"The NTL Developers. NTL: A Library for doing Number Theory (Version 11.5.1) (2021). https:\/\/libntl.org\/"},{"key":"12_CR15","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 9.0) (2020). https:\/\/www.sagemath.org"},{"key":"12_CR16","unstructured":"Plantard, M.T.: Ideal Lattice Challenge. http:\/\/www.latticechallenge.org\/ideallattice-challenge\/"},{"key":"12_CR17","unstructured":"Voulgaris, P.: Gauss sieve alpha v. 0.1 (2010). http:\/\/cseweb.ucsd.edu\/~pvoulgar\/impl.html"}],"container-title":["Communications in Computer and Information Science","Mobile Internet Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-4465-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T17:03:14Z","timestamp":1720717394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-4465-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819744640","9789819744657"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-4465-7_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MobiSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mobile Internet Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Okinawa","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mobisec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isyou.biz\/conf\/mobisec23\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}