|
|
A Survey of Elliptic Curve Cryptosystems, Part I: Introductory
– San C. Vo
- 2003
|
|
8
|
Fast computation with two algebraic numbers
– Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost
- 2002
|
|
9
|
Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm
– François Morain
- 1988
|
|
1
|
Computational Methods in Public Key Cryptology
– Arjen K. Lenstra
- 2002
|
|
3
|
Cryptography Meets Voting
– Warren Smith
- 2005
|
|
2
|
Efficient Approximation Algorithms for Sparse Polynomials over Finite Fields
– Marek Karpinski, Igor Shparlinski
- 1994
|
|
56
|
Subquadratic-time factoring of polynomials over finite fields
– Erich Kaltofen, Victor Shoup
- 1998
|
|
6
|
A Binary Algorithm for the Jacobi Symbol
– Jeffrey Shallit, Jonathan Sorenson
- 1993
|
|
1
|
Modular composition modulo triangular sets and applications
– Adrien Poteaux, Éric Schost
- 2010
|
|
3
|
Space-efficient evaluation of hypergeometric series
– Howard Cheng, Barry Gergel, Ethan Kim, Eugene Zima
|
|
3
|
Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts
– P. Mihăilescu, F. Morain, É. Schost
|
|
17
|
Fast Computation of Special Resultants
– Alin Bostan , et al.
- 2006
|
|
9
|
Counting Curves and Their Projections
– Joachim Von Zur Gathen, Marek Karpinski, Igor Shparlinski
- 1996
|
|
|
MpNT: A Multi-Precision Number Theory Package. Number-Theoretic . . .
– F. L. Tiplea, S. Iftene, I. Goriac, R. M. Gordân, E. Erbiceanu, et al.
- 2003
|
|
|
Discrete logarithms: The past and the future
– Andrew Odlyzko Att, Andrew Odlyzko
- 2000
|
|
38
|
New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n
– Kenji Koyama, Ueli M Maurer, Tatsuaki Okamoto, Scott A Vanstone
- 1991
|
|
|
Algorithmic Number Theory MSRI Publications
– unknown authors
|
|
|
Algorithmic Number Theory MSRI Publications
– unknown authors
|
|
3
|
Elliptic Curves and their use in Cryptography
– Victor S. Miller
- 1997
|