{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:16:41Z","timestamp":1725567401802},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666660"},{"type":"electronic","value":"9783540480006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48000-6_11","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T02:51:39Z","timestamp":1287024699000},"page":"122-134","source":"Crossref","is-referenced-by-count":3,"title":["ECC: Do We Need to Count?"],"prefix":"10.1007","author":[{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"first","affiliation":[]},{"given":"Helena","family":"Handschuh","sequence":"additional","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S1385-7258(51)50008-2","volume":"13","author":"N. Bruijn de","year":"1951","unstructured":"de Bruijn, N.: On the number of positive integers \u2264 x and free of prime factos \u2265 y. Indagationes Mathematicae\u00a013, 50\u201360 (1951)","journal-title":"Indagationes Mathematicae"},{"key":"11_CR2","first-page":"236","volume":"28","author":"N. Bruijn de","year":"1966","unstructured":"de Bruijn, N.: On the number of positive integers \u2264 x and free of prime factos \u2265 y, II. Indagationes Mathematicae\u00a028, 236\u2013247 (1966)","journal-title":"Indagationes Mathematicae"},{"key":"11_CR3","unstructured":"Couveignes, J.-M., Dewaghe, L., Morain, F.: Isogeny cycles and the Schoof-Elkies-Atkin algorithm, Rapport de recherche LIX\/RR\/96\/03, Laboratoire d\u2019informatique de l\u2019\u00c9cole Polytechnique (1996)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58691-1_42","volume-title":"Algorithmic Number Theory","author":"J.-M. Couveignes","year":"1994","unstructured":"Couveignes, J.-M., Morain, F.: Schoof\u2019s algorithm and isogeny cycles. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 43\u201358. Springer, Heidelberg (1994)"},{"issue":"10","key":"11_CR5","first-page":"1","volume":"22A","author":"K. Dickman","year":"1930","unstructured":"Dickman, K.: On the frequency of numbers containing prime factors of a certain relative magnitude. Arkiv f\u00f6r matematik, astronomi och fysik\u00a022A(10), 1\u201314 (1930)","journal-title":"Arkiv f\u00f6r matematik, astronomi och fysik"},{"issue":"153","key":"11_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"J. Dixon","year":"1981","unstructured":"Dixon, J.: Asymptotically fast factorization of integers. Mathematics of computation\u00a036(153), 255\u2013260 (1981)","journal-title":"Mathematics of computation"},{"issue":"21","key":"11_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1112\/plms\/s3-21.1.102","volume":"3","author":"H. Halberstam","year":"1970","unstructured":"Halberstam, H.: On integers whose prime factors are small. Proceedings of the London mathematical society\u00a03(21), 102\u2013107 (1970)","journal-title":"Proceedings of the London mathematical society"},{"key":"11_CR8","first-page":"229","volume":"85","author":"E. Howe","year":"1993","unstructured":"Howe, E.: On the group orders of elliptic curves over finite fields. Compositio mathematica\u00a085, 229\u2013247 (1993)","journal-title":"Compositio mathematica"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2140\/pjm.1988.131.157","volume":"131","author":"N. Koblitz","year":"1988","unstructured":"Koblitz, N.: Primality of the number of points on an elliptic curve over a finite field. Pacific Journal of Mathematics\u00a0131, 157\u2013165 (1988)","journal-title":"Pacific Journal of Mathematics"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BFb0054116","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Kunihiro","year":"1998","unstructured":"Kunihiro, N., Koyama, K.: Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 47\u201358. Springer, Heidelberg (1998)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Number Theory","author":"G. Lay","year":"1994","unstructured":"Lay, G., Zimmer, H.: Constructing elliptic curves with given group order over large finite fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, Springer, Heidelberg (1994)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.: Factoring integers with elliptic curves. Ann. math.\u00a0126, 649\u2013673 (1987)","journal-title":"Ann. math."},{"key":"11_CR13","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 GF(2n). In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 197\u2013212. Springer, Heidelberg (1996)"},{"key":"11_CR14","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: strategies and performances. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 79\u201394. Springer, Heidelberg (1995)"},{"key":"11_CR15","unstructured":"Lercier, R., Morain, F.: Counting the number of points on elliptic curves over F\n                    \n                      \n                    \n                    $_{p^n}$\n                   using Couveigne\u2019s algorithm, Rapport de recherche LIX\/RR\/95\/09, Laboratoire d\u2019informatique de l\u2019\u00c9cole Polytechnique (1995)"},{"key":"11_CR16","first-page":"25","volume-title":"Elliptic curve public key cryptosystems","author":"A. Menezes","year":"1983","unstructured":"Menezes, A.: Elliptic curve public key cryptosystems, p. 25. Kluwer academic publishers, Dordrecht (1983)"},{"issue":"201","key":"11_CR17","first-page":"407","volume":"60","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Vanstone, S., Zuccharato, R.: Counting points on elliptic curves over F\n                    \n                      \n                    \n                    $_{2^m}$\n                  . Mathematics of computation\u00a060(201), 407\u2013420 (1993)","journal-title":"Mathematics of computation"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BFb0054143","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"G. Poupard","year":"1998","unstructured":"Poupard, G., Stern, J.: A practical and provably secure design for on the fly authentication and signature generation. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 422\u2013436. Springer, Heidelberg (1998)"},{"key":"11_CR20","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"},{"issue":"2","key":"11_CR21","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Schoof","year":"1978","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. CACM\u00a021(2), 120\u2013126 (1978)","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48000-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:33:27Z","timestamp":1553171607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48000-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666660","9783540480006"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48000-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}