Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \mathbb{F}_{{\text{2}}^n } $$-Reference-Cited by-同舟云学术

Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \mathbb{F}_{{\text{2}}^n } $$

Published:1997 Issue: Volume: Page:379-392
ISSN:0302-9743
Container-title:Advances in Cryptology — EUROCRYPT ’97
language:
Short-container-title:

Author:

Lercier Reynald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-69053-0_26

Reference40 articles.

1. Lect Notes Comput Sci;A. Bender,1989

2. 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.

3. 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.

4. F. Chabaud and R. Lercier. A new toolbox for finite extensions of finite fields. Rapport technique, Laboratoire d’Informatique de l’École polytechnique (LIX), 1996. In preparation.

5. F. Chabaud and R. Lercier. ZEN, User Manual. Laboratoire d’Informatique de l’École polytechnique (LIX), 1996. Available at http://lix.polytechnique.fr/~zen/ .

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing cardinalities of -curve reductions over finite fields;LMS Journal of Computation and Mathematics;2016

2. Elliptic Curve Cryptosystems;Hiding Data - Selected Topics;2016

3. Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields;Advances in Cryptology - EUROCRYPT 2009;2009

4. A Public-Key Encryption Scheme with Pseudo-random Ciphertexts;Computer Security – ESORICS 2004;2004

5. Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy;Lecture Notes in Computer Science;2001