{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:13:38Z","timestamp":1649088818890},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1587\/transfun.2020cip0014","type":"journal-article","created":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T22:14:30Z","timestamp":1609452870000},"page":"79-88","source":"Crossref","is-referenced-by-count":0,"title":["Faster Rotation-Based Gauss Sieve for Solving the SVP on General Ideal Lattices"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Shintaro","family":"NARISADA","sequence":"first","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"OKADA","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhide","family":"FUKUSHIMA","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"KIYOMOTO","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Ajtai, \u201cThe shortest vector problem in <i>L<\/i><sub>2<\/sub> is <i>NP<\/i>-hard for randomized reductions,\u201d Proc. thirtieth annual ACM symposium on Theory of computing, pp.10-19, 1998. 10.1145\/276698.276705","DOI":"10.1145\/276698.276705"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M. Pohst, \u201cOn the computation of lattice vectors of minimal length, successive minima and reduced bases with applications,\u201d SIGSAM Bull., vol.15, no.1, pp.37-44, 1981. 10.1145\/1089242.1089247","DOI":"10.1145\/1089242.1089247"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Ajtai, R. Kumar, and D. Sivakumar, \u201cA sieve algorithm for the shortest lattice vector problem,\u201d Proc. Thirty-third Annual ACM Symposium on Theory of Computing, STOC&apos;01, pp.601-610, ACM, 2001. 10.1145\/380752.380857","DOI":"10.1145\/380752.380857"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D. Micciancio and P. Voulgaris, \u201cFaster exponential time algorithms for the shortest vector problem,\u201d Proc. Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, SODA&apos;10, pp.1468-1480, SIAM, 2010. 10.1137\/1.9781611973075.119","DOI":"10.1137\/1.9781611973075.119"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] L. Ducas, \u201cShortest vector from lattice sieving: A few dimensions for free,\u201d Advances in Cryptology-EUROCRYPT 2018, pp.125-145, Springer, 2018. 10.1007\/978-3-319-78381-9_5","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M.R. Albrecht, L. Ducas, G. Herold, E. Kirshanova, E.W. Postlethwaite, and M. Stevens, \u201cThe general sieve kernel and new records in lattice reduction,\u201d Advances in Cryptology-EUROCRYPT 2019, pp.717-746, Springer, 2019. 10.1007\/978-3-030-17656-3_25","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S. Garg, C. Gentry, and S. Halevi, \u201cCandidate multilinear maps from ideal lattices,\u201d Advances in Cryptology-EUROCRYPT 2013, pp.1-17, Springer, 2013. 10.1007\/978-3-642-38348-9_1","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J. Hoffstein, J. Pipher, and J. Silverman, \u201cNTRU: A ring-based public key cryptosystem,\u201d Algorithmic Number Theory, pp.267-288, Springer, 1998. 10.1007\/bfb0054868","DOI":"10.1007\/BFb0054868"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M. Schneider, \u201cSieving for shortest vectors in ideal lattices,\u201d Progress in Cryptology-AFRICACRYPT 2013, pp.375-391, Springer, 2013. 10.1007\/978-3-642-38553-7_22","DOI":"10.1007\/978-3-642-38553-7_22"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] T. Plantard, W. Susilo, and Z. Zhang, \u201cLLL for ideal lattices: re-evaluation of the security of Gentry-Halevi&apos;s FHE scheme,\u201d Des. Codes Cryptogr., vol.76, pp.325-344, 2015. 10.1007\/s10623-014-9957-1","DOI":"10.1007\/s10623-014-9957-1"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A.K. Lenstra, H.W. Lenstra, and L. Lov\u00e1sz, \u201cFactoring polynomials with rational coefficients,\u201d Math. Ann., vol.261, no.4, pp.515-534, 1982. 10.1007\/bf01457454","DOI":"10.1007\/BF01457454"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] T. Ishiguro, S. Kiyomoto, Y. Miyake, and T. Takagi, \u201cParallel Gauss sieve algorithm: Solving the SVP challenge over a 128-dimensional ideal lattice,\u201d Public-Key Cryptography-PKC 2014, pp.411-428, Springer, 2014. 10.1007\/978-3-642-54631-0_24","DOI":"10.1007\/978-3-642-54631-0_24"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] V. Lyubashevsky, C. Peikert, and O. Regev, \u201cOn ideal lattices and learning with errors over rings,\u201d Advances in Cryptology-EUROCRYPT 2010, pp.1-23, Springer, 2010. 10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] H. Riesel, Prime Numbers and Computer Methods for Factorization, pp.305-308, Birch\u00e4user, 1994. 10.1007\/978-1-4612-0251-6_7","DOI":"10.1007\/978-1-4612-0251-6"},{"key":"15","unstructured":"[15] P. Klein, \u201cFinding the closest lattice vector when it&apos;s unusually close,\u201d Proc. Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA&apos;00, pp.937-941, SIAM, 2000."},{"key":"16","unstructured":"[16] T. Nagell, Introduction to Number Theory, pp.158-168, Wiley, 1951."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] L. Carlitz, \u201cThe number of terms in the cyclotomic polynomial F<sub>pq<\/sub>(x),\u201d The American Mathematical Monthly, vol.73, no.9, pp.979-981, 1966. 10.2307\/2314500","DOI":"10.2307\/2314500"},{"key":"18","unstructured":"[18] A. Migotti, \u201cZur Theorie der Kreisteilungs-gleichung,\u201d S.-B. der Math.-Naturwiss. Class der Kaiser. Akad. Der Wiss., Wien, vol.87, pp.7-14, 1883."},{"key":"19","unstructured":"[19] P. Voulgaris, \u201cA simple implementation in C++ of Gauss Sieve,\u201d https:\/\/cseweb.ucsd.edu\/~pvoulgar\/impl.html"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020CIP0014\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T03:37:24Z","timestamp":1609558644000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020CIP0014\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020cip0014","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}