Elliptic Curve Cryptosystems
暂无分享,去创建一个
[1] Thomas Beth,et al. Arithmetic Operations in GF(2 m ). , 1993 .
[2] R. Zuccherato,et al. Counting Points on Elliptic Curves Over F2m , 1993 .
[3] Alfred Menezes,et al. Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.
[4] Arjen K. Lenstra,et al. The number field sieve , 1990, STOC '90.
[5] Burton S. Kaliski,et al. Elliptic curves and cryptography: a pseudorandom bit generator and other tools , 1988 .
[6] C. Pomerance. Fast, Rigorous Factorization and Discrete Logarithm Algorithms , 1987 .
[7] Robert D. Silverman. The multiple polynomial quadratic sieve , 1987 .
[8] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[9] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[10] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[11] T. Elgamal. A subexponential-time algorithm for computing discrete logarithms over GF(p^2) , 1985 .
[12] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .
[13] Andrew M. Odlyzko,et al. Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.
[14] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[15] Don Coppersmith,et al. Fast evaluation of logarithms in fields of characteristic two , 1984, IEEE Trans. Inf. Theory.
[16] Michael Ben-Or,et al. Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[17] J. Rosser,et al. Approximate formulas for some functions of prime numbers , 1962 .