{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:44Z","timestamp":1750307624185,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","license":[{"start":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T00:00:00Z","timestamp":1216944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2008,7,25]]},"abstract":"<jats:p>Public key cryptography is widely used because it enables secure communication with a party accessing the site for the first time. But it is widely known that the quantum computers become available then the public key cryptosystems based on the discrete logarithm probrem such as RSA cryptosystem and Elliptic Curve cryptosystem will no longer be secure. To address these issues, Akiyama-Goto algebraic Surface Public-key Cryptosystem (ASC) was developed [1], and opened to general public at website as a research news of Toshiba corporation in 2005. Its security is based on a decision randomizing polynomial problem which is related to a problem of finding sections on fibered algebraic surfaces. This problem can be reduced to solving a multivariate equation system and it is known to be NP-complete. In 2007, in the case that public-key is in a certain form, Uchiyama and Tokunaga successed to attack in the sense of getting plain text from cipher text using reductions efficiently without solving section finding problem [2].And the abstract is introduced in CRYPTREC report 2006 [3] in the Appendix Chapter, which is known to be the important report related to e-Government recommended ciphers in Japan. Note that, at this point, the cryptosystem can be used safely if only we avoid to adopt using public key with vulnerability in the key generation step. However, the author suggested two algorithms applicable to all cases [5] i.e. the cryptosystem is completely broken. One is the generalization of Uchiyama-Tokunagas attack from polynomial ring over IFp to polynomial ring over rational function field. And the other takes advantages of Grobner base techniques so as to deal with in the polynomial ring over IFp. And in [6], the author also suggested methods for calculating zero point of the algebraic surface and a new attack utilizing it, and the approach resulted in the difficulty of making a suggestion of the invulnerable algebraic surface public-key cryptosystem without changing ideas progressively. On the other hand, Inanov-Volochs attack using trace map [9] was developed. In these background, Akiyama-Goto developed improved version of their Algebraic surface public-key cryptosystem (improved ASC) [8] on January 2008 [8] which has tolerance to Uchiyama-Gotos attack using reduction and Volochs attack using the trace map. Ivanov and Voloch suggested the substitution attack briefly on improved ASC in section 3 in [9], but the details are unspecified. In section 2, the improved ASC is described, and then, in section 3, a new reduction attack on the improved ASC is presented.<\/jats:p>","DOI":"10.1145\/1394042.1394083","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T13:22:19Z","timestamp":1217337739000},"page":"71-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An attack on improved algebraic surface public-key cryptosystem (abstract only)"],"prefix":"10.1145","volume":"42","author":[{"given":"Maki","family":"Iwami","sequence":"first","affiliation":[{"name":"Liberal Arts and Sciences, Osaka University of Economics and Law"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,25]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"119","volume-title":"Workshop Record of the International Workshop on Post-Quantum Cryptography (PQCrypto2006)","author":"Akiyama K.","year":"2006"},{"volume-title":"Symposium on Cryptography and Information Security (SCIS2007)","year":"2007","author":"Uchiyama S.","key":"e_1_2_1_2_1"},{"volume-title":"RYPTREC Report","year":"2006","author":"Cryptography Research and Evaluation Committees","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","first-page":"114","article-title":"A Reduction Attack on Algebraic Surface Public-Key Cryptosystems.Workshop of Research Institute for Mathematical Sciences (RIMS) Kyoto University, New development of research on Computer Algebra (held on July 4-6 2007)","volume":"1572","author":"Iwami M.","year":"2007","journal-title":"RIMS Kokyuroku"},{"volume":"5081","volume-title":"The Asian Symposium on Computer Mathematics (ASCM) 2007, December 2007. Appear to LNAI Proc. of the ASCM 2007","author":"Iwami M.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","unstructured":"M. Iwami : Towards designing the invulnerable algebraic surface public-key cryptosystem.Workshop of Research Institute for Mathematical Sciences (RIMS) Kyoto University Computer Algebra - Design of Algorithms Implementations and Applications (held on November 7-9 2007) RIMS Kokyuroku 2008.  M. Iwami : Towards designing the invulnerable algebraic surface public-key cryptosystem.Workshop of Research Institute for Mathematical Sciences (RIMS) Kyoto University Computer Algebra - Design of Algorithms Implementations and Applications (held on November 7-9 2007) RIMS Kokyuroku 2008."},{"key":"e_1_2_1_7_1","first-page":"93","article-title":"A Proposal for an Attack on Akiyama-Goto Algebraic Surface Public-Key Cryptosystems Utilizing Gr\u00f6bner Bases. Osaka Annals of the General Sciences Institute","volume":"27","author":"Iwami M","year":"2008","journal-title":"Osaka University of Economics and Law"},{"volume-title":"Symposium on Cryptography and Information Security (SCIS2008)","year":"2008","author":"Akiyama A.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","unstructured":"P. Ivanov and J. F. Voloch : Breaking the Akiyama-Goto cryptosystem. preprint (opened on the Internet)  P. Ivanov and J. F. Voloch : Breaking the Akiyama-Goto cryptosystem. preprint (opened on the Internet)"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394083","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:52Z","timestamp":1750250752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,25]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,7,25]]}},"alternative-id":["10.1145\/1394042.1394083"],"URL":"https:\/\/doi.org\/10.1145\/1394042.1394083","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2008,7,25]]},"assertion":[{"value":"2008-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}