Selecting Cryptographic Key Sizes

Selecting Cryptographic Key Sizes (2001)

Cached

Download Links

by Arjen K. Lenstra , Eric R. Verheul

Venue:	TO APPEAR IN THE JOURNAL OF CRYPTOLOGY, SPRINGER-VERLAG
Citations:	205 - 5 self

BibTeX

@MISC{Lenstra01selectingcryptographic,
    author = {Arjen K. Lenstra and Eric R. Verheul},
    title = { Selecting Cryptographic Key Sizes},
    year = {2001}
}

Bookmark

OpenURL

Abstract

In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over groups of elliptic curves over prime fields. Our recommendations are based on a set of explicitly formulated parameter settings, combined with existing data points about the cryptosystems.

Citations

713	Algorithms for quantum computation: discrete logarithms and factoring - Shor - 1994
252	Why cryptosystems fail - Anderson - 1994
220	A one round protocol for tripartite Diffie-Hellman - Joux - 2000
184	Lower bounds for discrete logarithms and related problems - Shoup - 1997
128	TJ: personal communication - Anderson, Hope
124	Parallel collision search with cryptanalytic applications - Oorschot, Wiener - 1999
82	Minimal key lengths for symmetric ciphers to provide adequate commercial security - Blaze, Diffie, et al. - 1996
78	The XTR public key system - Lenstra, Verheul - 2000
71	Evidence that XTR is more secure than supersingular elliptic curve cryptosystems - Verheul - 2004
64	Complexity of a determinate algorithm for the discrete logarithm - Nechaev
62	Improving the parallelized pollard lambda search on anomalous binary curves - Gallant, Lambert, et al. - 2000
57	Separating decision diffie-hellman from diffie-hellman in cryptographic groups. Cryptology ePrint Archive, Report 2001/003 - Joux, Nguyen - 2001
55	Faster Attacks on Elliptic Curve Cryptosystems - Wiener, Zuccherato - 1999
55	M.: Exhaustive cryptanalysis of the NBS data encryption standard - Diffie, Hellman - 1977
54	A fast new DES implementation in software - Biham - 1997
44	Performance Comparison of Public-Key Cryptosystems - Wiener - 1998
40	A One Round Protocol for Tripartite Di e-Hellman - Joux
38	Exhaustive Cryptanalysis of the NBS - Diffie, Hellman - 1977
34	The Future of Integer Factorization - ODLYZKO - 1995
32	A cost-based security analysis of symmetric and asymmetric key lengths - Silverman
26	A fast new DES implementation - Biham
23	Seperating decision Di#e-Hellman from Di#e-Hellman in cryptographic groups", J. Cryptology Online First, available from http://eprint.iacr.org/2001/003 - Joux, Nguyen
13	Factoring integers using SIMD sieves - Dixon, Lenstra - 1993
13	Analysis and optimization of the TWINKLE factoring Device - Lenstra, Shamir - 2000
12	te Riele, et al. Factorization of a 512-bit RSA modulus - Cavallar, Dodson, et al. - 2000
12	private communication - Zimmermann, Nelson, et al. - 2000
12	RSA for paranoids - Shamir - 1995
5	personal communication - Kocher - 1999
4	Efficient hardware and software - Davio, Desmedt, et al.
4	Efficient DES key search, manuscript - Wiener - 1993
4	Faster Hashing on the Pentium,” Rump Session of Eurocrypt ’97 - Bosselaers, “Even - 1997
3	Breaking DES, RSA Laboratories’ Cryptobytes, v - Kocher - 1999
2	Even faster hashing on the Pentium, manuscript, Katholieke Universiteit - Bosselaers - 1997
2	Possible NSA decryption capabilities, http://jya.com/nsa-study.htm - Brazier
2	personal communication - Gallant - 1999
2	personal communication - Menezes - 1999
2	letter to the editor - Montgomery - 1999
2	rump session presentation at Crypto’97 - Silverman
2	Exposing the Mythical MIPS - Silverman - 1999
2	Possible NSA decryption capabilities, jya.com/nsa-study.htm - Brazier
2	key lengths for symmetric ciphers to provide adequate commercial security, www.bsa.org/policy/encryption/cryptographers c.html - Wiener - 1996
1	Future Resiliency and High Security Systems - Johnson, ECC - 1999
1	Analysis and optimization of the TWINKLE factoring device, manuscript - Lenstra, Shamir - 1999
1	personal communication - Leyland - 1999
1	Factoring integers using the TWINKLE device, manuscript - Shamir - 1999
1	Faster attakcs on elliptic curve cryptosystems - Wiener, Zuccherato - 1999
1	te Riele, Factorization of a 512-bit RSA key using the number field sieve, manuscript - Cavallar, Dodson, et al.
1	TWINKLE and the number field sieve, manuscript in preparation - Lenstra, Shamir - 1999
1	Java applet on www.cryptosavvy.com - Puolamäki
1	Factoring integers using the TWINKLE device - Shamir - 1999