{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:09:10Z","timestamp":1725574150428},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669678"},{"type":"electronic","value":"9783540465881"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46588-1_15","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T21:55:48Z","timestamp":1294350948000},"page":"210-222","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Implementation of Schoof\u2019s Algorithm in Case of Characteristic 2"],"prefix":"10.1007","author":[{"given":"Tetsuya","family":"Izu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Kogure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases. Graduate Texts in Mathematics, vol.\u00a0141. Springer, Heidelberg (1993)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-61581-4_41","volume-title":"Algorithmic Number Theory","author":"J.-M. Couveignes","year":"1996","unstructured":"Couveignes, J.-M.: Computing \u2113-isogenies using the p-torsion. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 59\u201365. Springer, Heidelberg (1996)"},{"key":"15_CR3","unstructured":"Couveignes, J.-M., Dewaghe, L., Morain, F.: Isogeny cycles and the Schoof-Elkies- Atkin algorithm, LIX\/RR\/96\/03 (1996)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1090\/S0025-5718-98-00962-4","volume":"67","author":"L. Dewaghe","year":"1998","unstructured":"Dewaghe, L.: Remarks on the Schoof-Elkies-Atkin algorithm. Mathematics of Computation\u00a067, 1247\u20131252 (1998)","journal-title":"Mathematics of Computation"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/120694.120701","volume-title":"Proceedings of ISSAC 1991","author":"A. Giovini","year":"1991","unstructured":"Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C.: One sugar cube, please. In: Proceedings of ISSAC 1991, pp. 49\u201354. ACM Press, New York (1991)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-49649-1_7","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"T. Izu","year":"1998","unstructured":"Izu, T., Kogure, J., Noro, M., Yokoyama, K.: Efficient implementation of Schoof\u2019s algorithm. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 66\u201379. Springer, Heidelberg (1998)"},{"key":"15_CR7","unstructured":"Izu, T., Kogure, J., Noro, M., Yokoyama, K.: Order counting of elliptic curves defined over finite fields of characteristic 2. Transaction of IEICE Series A, vol.\u00a082, pp. 1253\u20131260 (1999) (in Japanese)"},{"key":"15_CR8","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":"15_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"15_CR10","unstructured":"Lercier, R.: Algorithmique des courbes elliptiques dansles corps finis, Doctoral Thesis, L\u2019\u00c9cole Polytechnique (1997)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-61581-4_55","volume-title":"Algorithmic Number Theory","author":"R. Lercier","year":"1996","unstructured":"Lercier, R.: Computing isogenies in F2\n                \n                  n\n                . In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 197\u2013212. Springer, Heidelberg (1996)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-69053-0_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Lercier","year":"1997","unstructured":"Lercier, R.: Finding good random elliptic curves for cryptosystems defined over F2\n                \n                  n\n                . In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 379\u2013392. Springer, Heidelberg (1997)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-49264-X_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"R. Lercier","year":"1995","unstructured":"Lercier, R., Morain, F.: Counting the number of points on elliptic curves over finite fields: strategy and performances. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 79\u201394. Springer, Heidelberg (1995)"},{"key":"15_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic curve public key cryptosystems","author":"A. Menezes","year":"1993","unstructured":"Menezes, A.: Elliptic curve public key cryptosystems. Kluwer Academic Publishers, Boston (1993)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/103418.103434","volume-title":"STOC 1991","author":"A. Menezes","year":"1991","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.E.: Reducing elliptic curves logarithms to logarithms in a finite field. In: STOC 1991, pp. 80\u201389. ACM Press, New York (1991)"},{"key":"15_CR16","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":"15_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/143242.143362","volume-title":"Proceedings of ISSAC 1992","author":"M. Noro","year":"1992","unstructured":"Noro, M., Takeshima, T.: Risa\/Asir \u2013 a computer algebra system. In: Proceedings of ISSAC 1992, pp. 387\u2013396. ACM Press, New York (1992)"},{"key":"15_CR18","first-page":"865","volume":"47","author":"T. Satoh","year":"1997","unstructured":"Satoh, T., Araki, K.: Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Commentarii Math. Univ. Sancti Pauli\u00a047, 865\u2013874 (1997)","journal-title":"Commentarii Math. Univ. Sancti Pauli"},{"key":"15_CR19","first-page":"483","volume":"44","author":"R. Schoof","year":"1985","unstructured":"Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Mathematics of Computation\u00a044, 483\u2013494 (1985)","journal-title":"Mathematics of Computation"},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux\u00a07, 219\u2013254 (1995)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","volume":"67","author":"I.A. Semaev","year":"1998","unstructured":"Semaev, I.A.: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curves in characteristic p. Mathematics of Computation\u00a067, 353\u2013356 (1998)","journal-title":"Mathematics of Computation"},{"key":"15_CR22","unstructured":"Smart, N.P.: The discrete logarithm problem on elliptic curves of trace one (1997) (preprint) (to appear in J. Cryptology)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","first-page":"472","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D.V. Vailey","year":"1998","unstructured":"Vailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorirthms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46588-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T09:58:09Z","timestamp":1553335089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46588-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540669678","9783540465881"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46588-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}