{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:25:13Z","timestamp":1742916313341,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646938"},{"type":"electronic","value":"9783540691051"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054030","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:42:35Z","timestamp":1149666155000},"page":"253-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameters for secure elliptic curve cryptosystem -improvements on Schoof s algorithm"],"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":"Masayuki","family":"Noro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"21_CR1","unstructured":"Atkin, A.O., The number of points on an elliptic curve modulo a prime, preprint, 1988."},{"key":"21_CR2","unstructured":"Couveignes, J.-M., Dewaghe, L., Morain, F., Isogeny cycles and the Schoof-Elkies-Atkin algorithm, LIX\/RR\/96\/03, 1996."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Couveignes, J,-M., Morain, F., Schoof's algorithm and isogeny cycles, In ANT-I,L.Adleman and M.-D.Huang, Eds., Lecture Notes in Computer Science, 877, pp.43\u201358, 1994.","DOI":"10.1007\/3-540-58691-1_42"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Elkies, N.D., Explicit isogenies, preprint, 1991.","DOI":"10.1155\/S1073792891000144"},{"key":"21_CR5","unstructured":"Izu, T., Kogure, J., Noro, M., Yokoyama, K., Secure Elliptic Curve Cryptosystem: Improvements on Schoof's Algorithm by Intelligent Choice System, in preparation."},{"key":"21_CR6","unstructured":"Lercier, R., Algorithmique des courbes elliptiques dans les corps finis, Doctoral Thesis, L'\u00e9cole Polytechnique, 1997."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Lercier, R., Finding good random elliptic curves for cryptosystems definded over 257-01, In EURO-CRYPTO '97, W.Fumy, Ed., Lecture Notes in Computer Science, 1233, pp.379\u2013392, 1997.","DOI":"10.1007\/3-540-69053-0_26"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Lercier, R., Morain, F., Counting the number of points on elliptic curves over finite fields: strategy and performances, In EURO-CRYPTO '95, L.C.Guillou and J.-J.Quisquater, Eds., Lecture Notes in Computer Science, 921, pp.79\u201394, 1995.","DOI":"10.1007\/3-540-49264-X_7"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.5802\/jtnb.143","volume":"7","author":"F. Morain","year":"1995","unstructured":"Morain, F., Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmiques, J. Th\u00e9or. Nombres Bordeaux 7 (1995) 255\u2013282.","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"21_CR10","unstructured":"Noro, M., Takeshima, T., ftp:\/\/endeavor.fujitsu.co.jp\/pub\/isis\/asir"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"Schoof, R., Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp.\n                        44 (1985) 483\u2013494.","journal-title":"Math. Comp."},{"key":"21_CR12","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\n                        7 (1995) 219\u2013254.","journal-title":"J. Th\u00e9or. Nombres Bordeaux"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T11:15:06Z","timestamp":1676632506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646938","9783540691051"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0054030","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"24 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}