{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:08:10Z","timestamp":1753884490659},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_26","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:24:05Z","timestamp":1186363445000},"page":"379-392","source":"Crossref","is-referenced-by-count":12,"title":["Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \\mathbb{F}_{{\\text{2}}^n } $$"],"prefix":"10.1007","author":[{"given":"Reynald","family":"Lercier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"26_CR1","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Advances in Cryptology","author":"A. Bender","year":"1989","unstructured":"A. Bender and G. Castagnoli. On the implementation of elliptic curve cryptosystems. In G. Brassard, editor, Advances in Cryptology, volume 435 of Lecture Notes in Comput. Sci., pages 186\u2013192. Springer-Verlag, 1989. Proc. Crypto\u2019 89, Santa Barbara, August 20\u201324."},{"key":"26_CR2","unstructured":"J.-M. Couveignes, L. Dewaghe, and F. Morain. Isogeny cycles and the Schoof-Elkies-Atkin algorithm. Research Report LIX\/RR\/96\/03, LIX, April 1996."},{"key":"26_CR3","unstructured":"B. W. Char, K. O. Geddes, G. H. Gonnet, and S. M. Watt. MAPLE Reference Manual, Fourth Edition. Symbolic Computation Group, Department of Computer Science, University of Waterloo, 1985."},{"key":"26_CR4","unstructured":"F. Chabaud and R. Lercier. A new toolbox for finite extensions of finite fields. Rapport technique, Laboratoire d\u2019Informatique de l\u2019\u00c9cole polytechnique (LIX), 1996. In preparation."},{"key":"26_CR5","unstructured":"F. Chabaud and R. Lercier. ZEN, User Manual. Laboratoire d\u2019Informatique de l\u2019\u00c9cole polytechnique (LIX), 1996. Available at http:\/\/lix.polytechnique.fr\/~zen\/ ."},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58691-1_42","volume-title":"ANTS-I","author":"J.-M. Couveignes","year":"1994","unstructured":"J.-M. Couveignes and F. Morain. Schoof\u2019s algorithm and isogeny cycles. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Comput. Sci., pages 43\u201358. Springer-Verlag, 1994. 1st Algorithmic Number Theory Symposium \u2014 Cornell University, May 6\u20139, 1994."},{"key":"26_CR7","unstructured":"J.-M. Couveignes. Quelques calculs en th\u00e9orie des nombres. Th\u00e8se, Universit\u00e9 de Bordeaux I, July 1994."},{"key":"26_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-61581-4_41","volume-title":"ANTS-II","author":"J.-M. Couveignes","year":"1996","unstructured":"J.-M. Couveignes. Computing l-isogenies with the p-torsion. In H. Cohen, editor, ANTS-II, volume 1122 of Lecture Notes in Comput. Sci., pages 59\u201365. Springer-Verlag, 1996."},{"key":"26_CR9","unstructured":"J. M. Couveignes. Isomorphisms between towers of artin-schreier exetensions over a finite fields. Draft, 1997."},{"key":"26_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-48658-5_6","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 94","author":"J. Chao","year":"1994","unstructured":"J. Chao, K. Tanada, and S. Tsujii. Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks. In Y. Desmedt, editor, Advances in Cryptology \u2014 CRYPTO\u2019 94, volume 839 of Lecture Notes in Comput. Sci., pages 50\u201355. Springer-Verlag, 1994. Proc. 14th Annual International Cryptology Conference, Santa Barbara, Ca, USA, August 21\u201325."},{"key":"26_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-47555-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"G. Harper","year":"1993","unstructured":"G. Harper, A. Menezes, and S. Vanstone. Public-key cryptosystems with very small key length. In R. A. Rueppel, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 92, volume 658 of Lecture Notes in Comput. Sci., pages 163\u2013173. Springer-Verlag, 1993. Workshop on the Theory and Application of Cryptographic Techniques, Balatonf\u00fcred, Hungary, May 24\u201328, 1992, Proceedings."},{"key":"26_CR12","first-page":"229","volume":"85","author":"E. W. Howe","year":"1993","unstructured":"E. W. Howe. On the group orders of elliptic curves over finite fields. Compositio Mathematica, 85:229\u2013247, 1993.","journal-title":"Compositio Mathematica"},{"key":"26_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Crypto 86","author":"B. S. Kaliski Jr.","year":"1986","unstructured":"B. S. Kaliski, Jr. A pseudo-random bit generator based on elliptic logarithms. In Proc. Crypto 86, volume 263 of Lecture Notes in Comput. Sci., 1986. Proceedings Crypto\u2019 86, Santa Barbara (USA), August 11\u201315, 1986."},{"issue":"177","key":"26_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48(177):203\u2013209, January 1987.","journal-title":"Math. Comp."},{"issue":"1","key":"26_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2140\/pjm.1988.131.157","volume":"131","author":"N. Koblitz","year":"1988","unstructured":"N. Koblitz. Primality of the number of points on an elliptic curve over a finite field. Pacific Journal of Mathematics, 131(1):157\u2013165, 1988.","journal-title":"Pacific Journal of Mathematics"},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF00196728","volume":"4","author":"N. Koblitz","year":"1991","unstructured":"N. Koblitz. Elliptic curve implementation of zero-knowledge blobs. Journal of Cryptology, 4(3):207\u2013213, 1991.","journal-title":"Journal of Cryptology"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. W. Lenstra Jr.","year":"1987","unstructured":"H. W. Lenstra, Jr. Factoring integers with elliptic curves. Annals of Math., 126:649\u2013673, 1987.","journal-title":"Annals of Math."},{"key":"26_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-61581-4_55","volume-title":"ANTS-II","author":"R. Lercier","year":"1996","unstructured":"R. Lercier. Computing isogenies in GF(2n). In H. Cohen, editor, ANTS-II, volume 1122 of Lecture Notes in Comput. Sci., pages 197\u2013212. Springer-Verlag, 1996."},{"key":"26_CR19","unstructured":"R. Lercier. Courbes elliptiques et cryptographie. Th\u00e8se, \u00c9cole polytechnique, 1997. Draft."},{"key":"26_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-49264-X_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 95","author":"R. Lercier","year":"1995","unstructured":"R. Lercier and F. Morain. Counting the number of points on elliptic curves over finite fields: strategies and performances. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology \u2014 EUROCRYPT\u2019 95, number 921 in Lecture Notes in Comput. Sci., pages 79\u201394, 1995. International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 1995, Proceedings."},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"R. Lercier and F. Morain. Counting the number of points on elliptic curves over F p n using Couveignes\u2019s algorithm. Rapport de Recherche LIX\/RR\/95\/09, Laboratoire d\u2019Informatique de l\u2019\u00c9cole poly-technique (LIX), 1995. Available at http:\/\/lix.polytechnique.fr\/~morain\/Articles .","DOI":"10.1007\/3-540-49264-X_7"},{"key":"26_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-58691-1_64","volume-title":"ANTS-I","author":"G.-J. Lay","year":"1994","unstructured":"G.-J. Lay and H. G. Zimmer. Constructing elliptic curves with given group order over large finite fields. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Comput. Sci., pages 250\u2013263. Springer-Verlag, 1994. 1st Algorithmic Number Theory Symposium-Cornell University, May 6\u20139, 1994."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"A. J. Menezes. Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"26_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BFb0026949","volume-title":"Advances in Cryptology","author":"V. Miller","year":"1987","unstructured":"V. Miller. Use of elliptic curves in cryptography. In A. M. Odlyzko, editor, Advances in Cryptology, volume 263 of Lecture Notes in Comput. Sci., pages 417\u2013426. Springer-Verlag, 1987. Proceedings Crypto\u2019 86, Santa Barbara (USA), August 11\u201315, 1986."},{"key":"26_CR25","series-title":"Lect Notes Comput Sci","first-page":"50","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u2019 91","author":"A. Miyaji","year":"1991","unstructured":"A. Miyaji. On ordinary elliptic curve cryptosystems. In Advances in Cryptology \u2014 ASIACRYPT\u2019 91, volume 739 of Lecture Notes in Comput. Sci., pages 50\u201355. Springer-Verlag, 1991."},{"key":"26_CR26","series-title":"Lect Notes Comput Sci","first-page":"479","volume-title":"Advances in cryptology \u2014 AUSCRYPT\u2019 92","author":"A. Miyaji","year":"1993","unstructured":"A. Miyaji. Elliptic curves over F p suitable for cryptosystems. In J. Seberry and Y. Zheng, editors, Advances in cryptology \u2014 AUSCRYPT\u2019 92, volume 718 of Lecture Notes in Comput. Sci., pages 479\u2013491. Springer-Verlag, 1993. Workshop on the theory and application of cryptographic techniques, Gold Coast, Queensland, Australia, December 13\u201316, 1992."},{"key":"26_CR27","unstructured":"F. Morain. Courbes elliptiques et tests de primalit\u00e9. PhD thesis, Universit\u00e9 Claude Bernard-Lyon I, September 1990."},{"key":"26_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-46416-6_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 91","author":"F. Morain","year":"1991","unstructured":"F. Morain. Building cyclic elliptic curves modulo large primes. In D. Davies, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 91, volume 547 of Lecture Notes in Comput. Sci., pages 328\u2013336. Springer-Verlag, 1991. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Brighton, United Kingdom, April 8\u201311, 1991."},{"key":"26_CR29","unstructured":"F. Morain. Classes d\u2019isomorphismes des courbes elliptiques supersinguli\u00e8res en caract\u00e9ristique \u2265 3. To appear in Utilitas Mathematica. Available at http:\/\/lix.polytechnique.fr\/~morain\/ , March 1996."},{"issue":"5","key":"26_CR30","first-page":"1639","volume":"39","author":"A. Menezes","year":"1993","unstructured":"A. Menezes, T. Okamoto, and S. A. Vanstone. Reducing elliptic curves logarithms to logarithms in a finite field. IEEETIT, 39(5):1639\u20131646, 1993.","journal-title":"IEEETIT"},{"key":"26_CR31","unstructured":"V. M\u00fcller. Ein Algorithmus zur Bestimmung der Punktanzahl elliptischer Kurven \u00fcber endlichen K\u00f6rpern der Charakteristik gr\u00f6\u00dfer drei. PhD thesis, Technischen Fakult\u00e4t der Universit\u00e4t des Saarlandes, 1995."},{"key":"26_CR32","series-title":"Lect Notes Comput Sci","first-page":"2","volume-title":"Advances in Cryptology","author":"A. Menezes","year":"1990","unstructured":"A. Menezes and S. A. Vanstone. The implementation of elliptic curve cryptosystems. In J. Seberry and J. Pieprzyk, editors, Advances in Cryptology, number 453 in Lecture Notes in Comput. Sci., pages 2\u201313. Springer-Verlag, 1990. Proceedings Auscrypt\u2019 90, Sysdney (Australia), January 1990."},{"issue":"201","key":"26_CR33","doi-asserted-by":"publisher","first-page":"407","DOI":"10.2307\/2153177","volume":"60","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes, S. A. Vanstone, and R. J. Zuccherato. Counting points on elliptic curves over F 2 m. Math. Comp., 60(201):407\u2013420, January 1993.","journal-title":"Math. Comp."},{"key":"26_CR34","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106\u2013110, 1978.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"143","key":"26_CR35","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. M. Pollard","year":"1978","unstructured":"J. M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32(143):918\u2013924, July 1978.","journal-title":"Math. Comp."},{"key":"26_CR36","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483\u2013494, 1985.","journal-title":"Math. Comp."},{"key":"26_CR37","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"R. Schoof. Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux, 7:219\u2013254, 1995. Available at http:\/\/www.emath.fr\/Maths\/Jtnb\/jtnb1995-1.html .","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"26_CR38","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1090\/pspum\/020\/0316385","volume":"20","author":"D. Shanks","year":"1971","unstructured":"D. Shanks. Class number, a theory of factorization, and genera. In Proc. Symp. Pure Math. vol. 20, pages 415\u2013440. AMS, 1971.","journal-title":"Proc. Symp. Pure Math"},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"J. H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate Texts in Mathematics. Springer, 1986.","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"26_CR40","series-title":"Lect Notes Comput Sci","first-page":"44","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 95","author":"R. Schroeppel","year":"1995","unstructured":"R. Schroeppel, H. Orman, S. O\u2019Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. In Don Coppersmith, editor, Advances in Cryptology \u2014 CRYPTO\u2019 95, volume 963 of Lecture Notes in Comput. Sci., pages 44\u201356. Springer-Verlag, 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:31:57Z","timestamp":1556739117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}