On the SEA algorithm used in finding secure elliptic curves with an early-abort strategy
![]() |
정배은
(한국전자통신연구원 정보보호연구본부)
류희수 (한국전자통신연구원 정보보호연구본부) |
1 |
ANTS-II: Computing l-isogenies with the p-torsion
/
DOI |
2 |
Advances in Cryptology-Eurocrypt'01: A memory Efficient Version of Satoh's Algorithm
/
|
3 |
The canonical lift of an ordinary elliptic curve over a finite field and its point counting
/
|
4 |
ANTS-II: Computing isogenies in GF(2ⁿ)
/
DOI |
5 |
Counting points on elliptic curves over finite fields
/
DOI |
6 |
/
|
7 |
/
|
8 |
An extension of Satoh's algorithm and its implementation
/
|
9 |
Elliptic and modular curves over finite fields and related computational issues
/
|
10 |
Advances in Cryptology-Eurocrypt'01: Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
/
|
11 |
Advances in Cryptology-Eurocrypt'97: Finding good random elliptic curves for cryptosystems defined over F 2ⁿ
/
|
![]() |