by N. P. Smart
http://www.cs.bris.ac.uk/Tools/Reports/Ps/2000-smart-0.ps.gz
Add To MetaCart
Abstract:
How secure are elliptic curves over composite extension fields? smart
Citations
|
386
|
Elliptic curve cryptosystems
– Koblitz
- 1987
|
|
301
|
Use of elliptic curves in cryptography
– Miller
- 1985
|
|
148
|
Monte Carlo methods for index computation (mod p
– Pollard
- 1978
|
|
104
|
Hyperelliptic Cryptosystems
– Koblitz
|
|
98
|
Advances in elliptic curve cryptography
– Blake, Seroussi, et al.
- 2005
|
|
95
|
Parallel Collision Search with Cryptanalytic Applications
– Oorschot, Wiener
- 1999
|
|
80
|
Constructive and destructive facets of Weil descent on elliptic curves
– Gaudry, Hess, et al.
- 2000
|
|
17
|
Analysis of the Weil descent attack of Gaudry
– Menezes, Qu
- 2001
|
|
14
|
The solution of McCurley's discrete log challenge
– Weber, Denny
- 1998
|
|
12
|
An algorithm of subexponential type computing the class group of quadratic orders over principal ideal domains, Algorithmic Number Theory - ANTSII (Université Bordeaux I
– Paulus
|
|
12
|
Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves
– Paulus, Stein
- 1998
|
|
10
|
An algorithm for solving the discrete logarithm problem on hyperelliptic curves
– Gaudry
- 2000
|
|
6
|
How to disguise an elliptic curve. Talk at Waterloo workshop on the ECDLP
– Frey
- 1998
|
|
5
|
Euclid's algorithm and the Lanczos method over finite fields
– Teitelbaum
- 1998
|
|
4
|
The Oakley Key Determination Protocol
– IETF
- 1998
|
|
4
|
Recommended Elliptic Curve Domain Parameters. Standards for Ecient Cryptography Group
– SEC
- 1999
|
|
3
|
A cryptographic application of Weil descent. Cryptography and
– Galbraith, Smart
- 1999
|
