{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:29:37Z","timestamp":1761647377741,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"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":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p>It is known that several public key cryptosystems such as RSAs, ElGamals and elliptic curve cryptosystems [1], and also elliptic curve cryptosystems require smaller keys and more efficient operation than RSAs and ElGamals for same security. For example, elliptic curve cryptosystems with 160 bits key have same security as RSAs and ElGamals with 1024 bits key have. We focus elliptic curve cryptosystems and propose an architecture of computation unit for an elliptic curve cryptosystem with small hardware.<\/jats:p>","DOI":"10.1145\/1055626.1055643","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"124-133","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["An architecture for elliptic curve cryptograph computation"],"prefix":"10.1145","volume":"33","author":[{"given":"Masaaki","family":"Shirase","sequence":"first","affiliation":[{"name":"School of Information Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Hibino","sequence":"additional","affiliation":[{"name":"School of Information Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"N. Koblitz A Course in Number Theory Springer-Verlag 1987.   N. Koblitz A Course in Number Theory Springer-Verlag 1987.","DOI":"10.1007\/978-1-4684-0310-7"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"J. Silverman The Arithmetic of Elliptic Curves Springer-Verlag 1986.  J. Silverman The Arithmetic of Elliptic Curves Springer-Verlag 1986.","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"D. V. Bailey C. Paar \"Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms\" Advances in Cryptology--CRYPTO'98 LNCS 1462 pp 472--485 Springer 1998.   D. V. Bailey C. Paar \"Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms\" Advances in Cryptology--CRYPTO'98 LNCS 1462 pp 472--485 Springer 1998.","DOI":"10.1007\/BFb0055748"},{"key":"e_1_2_1_5_1","unstructured":"A. R. Omondi Computer Arithmetic Systems Prentice Hall 1994.   A. R. Omondi Computer Arithmetic Systems Prentice Hall 1994."},{"key":"e_1_2_1_6_1","unstructured":"Parthenon http:\/\/www.kecl.ntt.co.jp\/parthenon\/html\/intro.htm  Parthenon http:\/\/www.kecl.ntt.co.jp\/parthenon\/html\/intro.htm"},{"key":"e_1_2_1_7_1","unstructured":"K. Aoki \"How fast can an elliptic curve cryptosystem be?\" (in Japanese) http:\/\/www.math.is.tohoku.ac.jp\/~taya\/sendaiNT\/2000\/aoki_m.pdf.  K. Aoki \"How fast can an elliptic curve cryptosystem be?\" (in Japanese) http:\/\/www.math.is.tohoku.ac.jp\/~taya\/sendaiNT\/2000\/aoki_m.pdf."},{"volume-title":"Springer","year":"1999","author":"Kobayashi T.","key":"e_1_2_1_8_1"}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1055626.1055643","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1055626.1055643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:27Z","timestamp":1750264287000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1055626.1055643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1145\/1055626.1055643"],"URL":"https:\/\/doi.org\/10.1145\/1055626.1055643","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2005,3]]},"assertion":[{"value":"2005-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}