{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:45:44Z","timestamp":1648514744392},"reference-count":27,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transfun.2021cip0021","type":"journal-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T22:09:41Z","timestamp":1638828581000},"page":"195-202","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting the Orthogonal Lattice Algorithm in Solving General Approximate Common Divisor Problem"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Xiaoling","family":"YU","sequence":"first","affiliation":[{"name":"College of Data Science, Taiyuan University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuntao","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chungen","family":"XU","sequence":"additional","affiliation":[{"name":"School of Science, Nanjing University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"TAKAGI","sequence":"additional","affiliation":[{"name":"Department of Mathematical Informatics, The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Aono, Y. Wang, T. Hayashi, and T. Takagi, \u201cImproved progressive BKZ algorithms and their precise cost estimation by sharp simulator,\u201d Advances in Cryptology-EUROCRYPT, 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, pp.789-819, May 2016. 10.1007\/978-3-662-49890-3_30","DOI":"10.1007\/978-3-662-49890-3_30"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D. Benarroch, Z. Brakerski, and T. Lepoint, \u201cFHE over the integers: Decomposed and batched in the post-quantum regime,\u201d Public-Key Cryptography-PKC, 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, pp.271-301, March 2017. 10.1007\/978-3-662-54388-7_10","DOI":"10.1007\/978-3-662-54388-7_10"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] N. Bindel, J. Buchmann, F. G\u00f6pfert, and M. Schmidt, \u201cEstimation of the hardness of the learning with errors problem with a restricted number of samples,\u201d J. Mathematical Cryptology, vol.13, no.1, pp.47-67, 2019. 10.1515\/jmc-2017-0040","DOI":"10.1515\/jmc-2017-0040"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Y. Chen and P.Q. Nguyen, \u201cFaster algorithms for approximate common divisors: Breaking fully-homomorphic-encryption challenges over the integers,\u201d Advances in Cryptology-EUROCRYPT, 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, pp.502-519, April 2012. 10.1007\/978-3-642-29011-4_30","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] J.H. Cheon, J. Coron, J. Kim, M.S. Lee, T. Lepoint, M. Tibouchi, and A. Yun, \u201cBatch fully homomorphic encryption over the integers,\u201d Advances in Cryptology-EUROCRYPT, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, pp.315-335, May 2013. 10.1007\/978-3-642-38348-9_20","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J.H. Cheon and D. Stehl\u00e9, \u201cFully homomophic encryption over the integers revisited,\u201d Advances in Cryptology-EUROCRYPT, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, pp.513-536, April 2015. 10.1007\/978-3-662-46800-5_20","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] H. Cohn and N. Heninger, \u201cApproximate common divisors via lattices,\u201d The Open Book Series 1, 10th Algorithmic Number Theory Symposium, Mathematical Sciences Publishers, San Diego, USA, pp.271-293, July 2012. 10.2140\/obs.2013.1.271","DOI":"10.2140\/obs.2013.1.271"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J. Coron, T. Lepoint, and M. Tibouchi, \u201cScale-invariant fully homomorphic encryption over the integers,\u201d Public-Key Cryptography-PKC, 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, pp.311-328, March 2014. 10.1007\/978-3-642-54631-0_18","DOI":"10.1007\/978-3-642-54631-0_18"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J. Coron, A. Mandal, D. Naccache, and M. Tibouchi, \u201cFully homomorphic encryption over the integers with shorter public keys,\u201d Advances in Cryptology-CRYPTO, 31st Annual Cryptology Conference, Santa Barbara, CA, USA, pp.487-504, Aug. 2011. 10.1007\/978-3-642-22792-9_28","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. Coron, D. Naccache, and M. Tibouchi, \u201cPublic key compression and modulus switching for fully homomorphic encryption over the integers,\u201d Advances in Cryptology-EUROCRYPT, 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, pp.446-464, April 2012. 10.1007\/978-3-642-29011-4_27","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"11","unstructured":"[11] J. Ding and C. Tao, \u201cA new algorithm for solving the approximate common divisor problem and cryptanalysis of the FHE based on GACD,\u201d IACR Cryptology ePrint Archive, 2014:42-56, 2014."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] S.D. Galbraith, S.W. Gebregiyorgis, and S. Murphy, \u201cAlgorithms for the approximate common divisor problem,\u201d LMS J. Comput. Math., vol.19, no.A, pp.58-72, 2016. 10.1112\/s1461157016000218","DOI":"10.1112\/S1461157016000218"},{"key":"13","unstructured":"[13] S. Gebregiyorgis, Algorithms for the Elliptic Curve Discrete Logarithm Problem and the Approximate Common Divisor Problem, PhD thesis, The University of Auckland, Auckland, New Zealand, 2016."},{"key":"14","unstructured":"[14] C. Gentry, A Fully Homomorphic Encryption Scheme, PhD thesis, The Department of Computer Science, Stanford University, Stanford, CA, USA, 2009."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] N. Howgrave-Graham, \u201cApproximate integer common divisors,\u201d Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, pp.51-66, March 2001. 10.1007\/3-540-44670-2_6","DOI":"10.1007\/3-540-44670-2_6"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] A. Lenstra, H. Lenstra, and L. Lov\u00e1sz, \u201cFactoring polynomial with rational coefficients,\u201d Math. Ann., vol.261, pp.515-534, 1982. 10.1007\/bf01457454","DOI":"10.1007\/BF01457454"},{"key":"17","unstructured":"[17] A. May, New RSA Vulnerabilities Using Lattice Reduction Methods, PhD thesis, University of Paderborn, Germany, 2003."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] P.Q. Nguyen and D. Stehl\u00e9, \u201cFloating-point LLL revisited,\u201d Advances in Cryptology-EUROCRYPT, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, vol.3494, pp.215-233, May 2005. 10.1007\/11426639_13","DOI":"10.1007\/11426639_13"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] P.Q. Nguyen and J. Stern, \u201cThe two faces of lattices in cryptology,\u201d Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, pp.146-180, March 2001. 10.1007\/3-540-44670-2_12","DOI":"10.1007\/3-540-44670-2_12"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] K. Nuida and K. Kurosawa, \u201c(Batch) fully homomorphic encryption over integers for non-binary message spaces,\u201d Advances in Cryptology-EUROCRYPT 2015, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, pp.537-555, April 2015. 10.1007\/978-3-662-46800-5_21","DOI":"10.1007\/978-3-662-46800-5_21"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] O. Regev, \u201cOn lattices, learning with errors, random linear codes, and cryptography,\u201d J. ACM, vol.56, no.6, pp.34:1-34:40, 2009. 10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] C. Schnorr, \u201cLattice reduction by random sampling and birthday methods,\u201d STACS, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, pp.145-156, Feb.-March 2003. 10.1007\/3-540-36494-3_14","DOI":"10.1007\/3-540-36494-3_14"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] A. Takayasu and N. Kunihiro, \u201cBetter lattice constructions for solving multivariate linear equations modulo unknown divisors,\u201d Information Security and Privacy-18th Australasian Conference, ACISP, Brisbane, Australia, pp.118-135, July 2013. 10.1007\/978-3-642-39059-3_9","DOI":"10.1007\/978-3-642-39059-3_9"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] S. Tonyali, K. Akkaya, N. Saputro, A.S. Uluagac, and M. Nojoumian, \u201cPrivacy-preserving protocols for secure and reliable data aggregation in IoT-enabled smart metering systems,\u201d Future Gener. Comput. Syst., vol.78, pp.547-557, 2018. 10.1016\/j.future.2017.04.031","DOI":"10.1016\/j.future.2017.04.031"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, \u201cFully homomorphic encryption over the integers,\u201d Advances in Cryptology-EUROCRYPT, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco\/French Riviera, vol.6110, pp.24-43, May-June 2010. 10.1007\/978-3-642-13190-5_2","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] X. Yu, Y. Wang, C. Xu, and T. Takagi, \u201cStudying the bounds on required samples numbers for solving the general approximate common divisors problem,\u201d International Conference on Information Science and Control Engineering, ICISCE, Zhengzhou, China, pp.533-537, July 2018. 10.1109\/icisce.2018.00117","DOI":"10.1109\/ICISCE.2018.00117"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] L. Zhou, L. Wang, T. Ai, and Y. Sun, \u201cBeekeeper 2.0: Confidential blockchain-enabled IoT system with fully homomorphic computation,\u201d Sensors, vol.18, no.11, p.3785, 2018. 10.3390\/s18113785","DOI":"10.3390\/s18113785"}],"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\/E105.A\/3\/E105.A_2021CIP0021\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T03:19:38Z","timestamp":1646450378000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/3\/E105.A_2021CIP0021\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021cip0021","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021CIP0021"}}