Computational Methods in Public Key Cryptology

Computational Methods in Public Key Cryptology (2002)

Cached

Download Links

[www.win.tue.nl]
[www.cryptosavvy.com]

Other Repositories/Bibliography

DBLP

by Arjen K. Lenstra

Citations:

1 - 1 self

BibTeX

@MISC{Lenstra02computationalmethods,
    author = {Arjen K. Lenstra},
    title = {      Computational Methods in Public Key Cryptology},
    year = {2002}
}

Bookmark

OpenURL

Abstract

These notes informally review the most common methods from computational number theory that have applications in public key cryptology.

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New Directions in Cryptography - Diffie, Hellman - 1976
2057	Handbook of Applied Cryptography - Menezes, Oorschot, et al. - 1997
961	A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm - ElGamal - 1985
713	Algorithms for quantum computation: discrete logarithms and factoring - Shor - 1994
687	The arithmetic of elliptic curves - Silverman - 1985
670	An Introduction to the Theory of Numbers - Hardy, Wright - 1971
592	The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition - Knuth - 1997
559	Elliptic curve cryptosystems - Koblitz - 1987
512	Efficient signature generation for smart cards - Schnorr - 1991
419	Use of elliptic curves in cryptography - Miller - 1986
345	Finite Fields and their Applications - Lidl, Niederreiter - 1984
337	Modular multiplication without trial division - Montgomery - 1985
256	An improved algorithm for computing logarithms over GF (p) and its cryptographic significance - Pohlig, Hellman - 1978
238	On the importance of checking cryptographic protocols for faults - Boneh, Demillo, et al.
234	New directions in cryptography - e, Hellman - 1976
199	Factoring integers with elliptic curves - Lenstra - 1987
193	Monte Carlo methods for index computation (mod p - Pollard - 1978
184	Lower bounds for discrete logarithms and related problems - Shoup - 1997
165	A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory - Adleman, DeMarrais, et al. - 1994
154	Elliptic curves over finite fields and the computation of square roots mod p - Schoof - 1985
149	Speeding the Pollard and elliptic curve methods of factorization - Montgomery - 1987
143	Solving sparse linear equations over finite fields - Wiedemann - 1986
142	Small Solutions to Polynomial Equations, and Low Exponent Vulnerabilities - Coppersmith - 1997
138	A Survey of Fast Exponentiation Methods - Gordon - 1998
136	Advance in elliptic curve cryptography - Blake, Seroussi, et al. - 2005
124	Parallel collision search with cryptanalytic applications - Oorschot, Wiener - 1999
120	Efficient elliptic curve exponentiation using mixed coordinates - Cohen, Miyaji, et al. - 1998
113	Cryptanalysis of short RSA secret exponents - Wiener - 1990
108	The development of the number field sieve - Lenstra, Lenstra - 1993
96	An algebraic method for public key cryptography - Anshel, Anshel, et al. - 1999
85	Cryptanalysis of RSA with private key d less than N 0.292 - Boneh, Durfee - 1999
80	public key cryptosystem using Braid groups - Ko, Lee, et al. - 2000
79	NTRU: A Ring-Based Public Key Cryptosystem - Hoffstein, Pipher, et al. - 1998
78	The XTR public key system - Lenstra, Verheul - 2000
76	Finding a small root of a univariate modular equation - Coppersmith - 1996
76	S.: A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases - Itoh, Tsujii - 1988
72	Fast evaluation of logarithms in fields of characteristic two - Coppersmith - 1984
69	The multiple polynomial quadratic sieve - Silverman - 1987
69	Algorithms for black box fields and their application to cryptography - Boneh, Lipton - 1996
66	Low-exponent RSA with Related Messages - Coppersmith, Franklin, et al. - 1996
64	Complexity of a determinate algorithm for the discrete logarithm - Nechaev
61	Fast exponentiation with precomputation - Brickell, Gordon, et al. - 1992
61	Solving simultaneous modular equations of low degree - Hastad - 1988
61	Theorems of factorization and primality testing - Pollard - 1974
61	There are infinitely many Carmichael numbers - Alford, Granville, et al. - 1994
59	On a problem of Oppenheim concerning “Factorisatio Numerorum - Canfield, Erdős, et al. - 1983
57	Separating decision diffie-hellman from diffie-hellman in cryptographic groups. Cryptology ePrint Archive, Report 2001/003 - Joux, Nguyen - 2001
57	Solving large sparse linear systems over finite fields - LaMacchia, Odlyzko
51	Factoring by electronic mail - Lenstra, Manasse - 1989