{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:35Z","timestamp":1725475835285},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673804"},{"type":"electronic","value":"9783540455684"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719994_8","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T15:38:40Z","timestamp":1167493120000},"page":"82-101","source":"Crossref","is-referenced-by-count":0,"title":["Over F p vs. over F $_{2^{n}}$ and on Pentium vs. on Alpha in Software Implementation of Hyperelliptic Curve Cryptosystems"],"prefix":"10.1007","author":[{"given":"Yasuyuki","family":"Sakai","sequence":"first","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-58691-1_39","volume-title":"Algorithmic Number Theory","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.: A Subexponential Algorithm for Discrete Logarithm over the Rational Subgroup of the Jacobians of Large Genus Hyperelliptic Curves over Finite Fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 28\u201340. Springer, Heidelberg (1994)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Buhler, J., Koblitz, N.: An Application of Lattice Basis Reduction to Jacobi Sums and Hyperelliptic Cryptosystems (1997) (Preprint)","DOI":"10.1017\/S000497270003207X"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D.V. Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-46416-6_27","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T. Beth","year":"1991","unstructured":"Beth, T., Schaefer, F.: Non supersingular elliptic curves for public key cryptosystems. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 316\u2013327. Springer, Heidelberg (1991)"},{"issue":"177","key":"8_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"D.G. Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in the Jacobian of a Hyperelliptic Curve. Math. Comp.\u00a048(177), 95\u2013101 (1987)","journal-title":"Math. Comp."},{"key":"8_CR6","unstructured":"http:\/\/www.certicom.com\/"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation Using Mixed Coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-48658-5_6","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"J. Chao","year":"1994","unstructured":"Chao, J., Tanaka, K., Tsujii, S.: Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 50\u201355. Springer, Heidelberg (1994)"},{"key":"#cr-split#-8_CR9.1","doi-asserted-by":"crossref","unstructured":"Duursma, I., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms, LIX Research Report LIX\/ RR\/99\/03 (1999)","DOI":"10.1007\/978-3-540-48000-6_10"},{"key":"#cr-split#-8_CR9.2","unstructured":"To appear in Lam, K.-Y., Okamoto, E., Xing, C. (eds.): ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 103-121. Springer, Heidelberg (1999)"},{"key":"8_CR10","unstructured":"Alpha Architecture Handbook version 4, Compaq, \n                    \n                      http:\/\/ftp.digital.com"},{"key":"8_CR11","unstructured":"Enge, A.: The extended Euclidean algorithm on polynomials, and the eciency of hyperelliptic cryptosystems, Preprint (1998)"},{"key":"8_CR12","unstructured":"Enge, A.: Computing Discrete Logarithms in High-Genus Hyperelliptic Jacobians in Provably Subexponential Time, Tech. Report from Center for Applied Cryptographic Research at the University of Waterloo, CORR 99-04 (1999)"},{"key":"8_CR13","unstructured":"Frey, G. , M\u00fcller, M., R\u00fcck, H.G.: The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems, Preprints der Arbeits-gruppe Zahlentheorie(1998), \n                    \n                      http:\/\/www.exp-math.uni-essen.de\/zahlentheorie\/preprints\/Index.html"},{"issue":"206","key":"8_CR14","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.G.: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves. Math. Comp.\u00a062(206), 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"#cr-split#-8_CR15.1","unstructured":"Gaudry, P.: A variant of the Adleman-DeMarrais-Huang algorithm and its application to small genera. LIX Research Report LIX\/RR\/99\/04 (1999)"},{"key":"#cr-split#-8_CR15.2","doi-asserted-by":"crossref","unstructured":"presented in Mathmatics of Public Key Cryptography 1999 (1999)","DOI":"10.1007\/978-1-4615-5207-9_1"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/BFb0052247","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Guajardo","year":"1997","unstructured":"GP97. J. Guajardo and C. Paar, \\E_cient Algorithms for Elliptic Curve Cryptosystems\", Advances in Cryptology { CRYPTO\u201997, LNCS, 1294 (1997), Springer-Verlag, 342{356."},{"key":"8_CR17","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Improving the parallelized Pollard lambda search on binary anomalous curves (April 1998), \n                    \n                      http:\/\/grouper.ieee.org\/groups\/1363\/contrib.html"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/0-387-34799-2_8","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"N. Koblitz","year":"1990","unstructured":"Koblitz, N.: A family of jacobians suitable for discrete log cryptosystems. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 94\u201399. Springer, Heidelberg (1990)"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystems. J. Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J. Cryptology"},{"key":"8_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic Aspects of Cryptography","author":"N. Koblitz","year":"1998","unstructured":"Koblitz, N.: Algebraic Aspects of Cryptography. Springer, Heidelberg (1998)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V. Miller","year":"1986","unstructured":"Miller, V.: Uses of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithm to logarithm in a finite field. IEEE Trans. on IT\u00a039, 1639\u20131646 (1993)","journal-title":"IEEE Trans. on IT"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. on IT\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Trans. on IT"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","first-page":"80","volume-title":"Algorithmic Number Theory","author":"S. Paulus","year":"1998","unstructured":"PS98. S. Paulus and A. Stein, \\Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves\", Algorithmic Number Theory III, LNCS, 1423 (1998), Springer-Verlag, 80{94."},{"key":"8_CR27","unstructured":"R\u00fcck, H.G.: On the discrete logarithms in the divisor class group of curves. To appear in Math. Comp. (1997),"},{"key":"8_CR28","unstructured":"http:\/\/www.rsa.com"},{"key":"8_CR29","first-page":"81","volume":"47","author":"T. Satoh","year":"1998","unstructured":"Satoh, T., Araki, K.: Fermat Quotients and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves. Comm. Math. Univ. Sancti. Pauli\u00a047, 81\u201392 (1998)","journal-title":"Comm. Math. Univ. Sancti. Pauli"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","volume":"76","author":"I.A. Semaev","year":"1998","unstructured":"Semaev, I.A.: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Math. Comp.\u00a076, 353\u2013356 (1998)","journal-title":"Math. Comp."},{"key":"8_CR31","unstructured":"Smart, N.P.: The Discrete Logarithm Problem on Elliptic Curves of Trace One. To appear in J.Cryptology (1997) (Preprint)"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-48910-X_12","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"N.P. Smart","year":"1999","unstructured":"Smart, N.P.: On the performance of hyperelliptic cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 165\u2013175. Springer, Heidelberg (1999)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J.A. Solinas","year":"1997","unstructured":"Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 357\u2013371. Springer, Heidelberg (1997)"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-49649-1_8","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"Y. Sakai","year":"1998","unstructured":"Sakai, Y., Sakurai, K.: Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2\n                    n\n                  . In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 80\u201394. Springer, Heidelberg (1998)"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BFb0054023","volume-title":"Public Key Cryptography","author":"Y. Sakai","year":"1998","unstructured":"Sakai, Y., Sakurai, K., Ishizuka, H.: Secure hyperelliptic cryptosystems and their performance. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 164\u2013181. Springer, Heidelberg (1998)"},{"key":"8_CR36","volume-title":"Algebraic Function Fields and Codes","author":"H. Stichtenoth","year":"1993","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. Springer, Heidelberg (1993)"},{"key":"8_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0034836","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"E. Win De","year":"1996","unstructured":"De Win, E., Bosselaers, A., Vandenberghe, S.: A Fast Software Implementation for Arithmetic Operations in GF(2n) Advances in Cryptology. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 65\u201376. Springer, Heidelberg (1996)"},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0054867","volume-title":"Algorithmic Number Theory","author":"E. Win De","year":"1998","unstructured":"Wiener, M., Zuccherato, R.: Faster Attacks on Elliptic Curve Cryptosystems (1998), \n                    \n                      http:\/\/grouper.ieee.org\/groups\/1363\/contrib.html"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Wiener, M., Zuccherato, R.: Faster Attacks on Elliptic Curve Cryptosystems (1998), \n                    \n                      http:\/\/grouper.ieee.org\/groups\/1363\/contrib.html","DOI":"10.1007\/3-540-48892-8_15"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC\u201999"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719994_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:11:48Z","timestamp":1558285908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719994_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673804","9783540455684"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/10719994_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}