(Enter summary)
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 hypotheses, combined
with existing data points about the cryptosystems. (Update)
Cited by: More
Reputation-based Wi-Fi Deployment - Naouel Ben Salem
(Correct)
On the Provable Security of an Efficient RSA-Based.. - Steinfeld, Pieprzyk.. (2006)
(Correct)
Packet Leashes: A Defense against - Wormhole Attacks In
(Correct)
Similar documents (at the sentence level):
68.9%: Selecting Cryptographic Key Sizes - Lenstra, Verheul (2001)
(Correct)
Active bibliography (related documents): More All
0.3: Computational Methods in Public Key Cryptology - Lenstra (2001)
(Correct)
0.3: Practical cryptography - the key size problem: PGP after years - Fibíková, Vyskoc (2001)
(Correct)
0.2: Timing Optimization for Multi-Source Nets: Characterization and .. - John Lillis (1999)
(Correct)
Similar documents based on text: More All
0.9: The XTR public key system - Lenstra, Verheul (2000)
(Correct)
0.5: Doing More with Fewer Bits - Brouwer, Pellikaan, Verheul (1999)
(Correct)
0.4: Factorization of a 512-bit RSA Modulus - Cavallar, Dodson, Lenstra, Lioen, .. (2000)
(Correct)
Related documents from co-citation: More All
24: A method for obtaining digital signatures and public-key cryptosystems; Communic..
- Rivest, Shamir et al. - 1978
20: Handbook of Applied Cryptography (context) - Menezes, Van Oorschot et al. - 1996
16: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack
- Goldwasser, Micali et al. - 1988
BibTeX entry: (Update)
A.K. Lenstra and E.R. Verheul, Selecting Cryptographic Key Sizes, manuscript, (Oct.1999). http://citeseer.ist.psu.edu/lenstra99selecting.html More
@article{ lenstra01selecting,
author = "Arjen K. Lenstra and Eric R. Verheul",
title = "Selecting Cryptographic Key Sizes",
journal = "Journal of Cryptology: the journal of the International Association for Cryptologic Research",
volume = "14",
number = "4",
pages = "255--293",
year = "2001",
url = "citeseer.ist.psu.edu/lenstra99selecting.html" }
Citations (may not include all citations):
128
Why cryptosystems fail
- Anderson - 1994 ACM DBLP
124
Lower bounds for discrete logarithms and related problems
- Shoup DBLP
52
Parallel collision search with cryptanalytic applications
- van Oorschot, Wiener - 1999 DBLP
51
Exhaustive cryptanalysis of the NBS Data Encryption Standard (context) - Diffie, Hellman - 1977
43
A fast new DES implementation in software
- Biham ACM DBLP
41
Minimal key lengths for symmetric ciphers to provide adequat.. (context) - Blaze, Diffie et al. - 1996
39
The future of integer factorization (context) - Odlyzko - 1995
37
Efficient DES key search
- Wiener - 1993
29
Improving the parallelized Pollard lambda search on binary a..
- Gallant, Lambert et al. - 1998
25
Performance Comparison of Public-Key Cryptosystems (context) - Wiener - 1998
14
personal communication (context) - Kocher - 1999
14
Factorization of a 512-bit RSA modulus
- Cavallar, Dodson et al. - 1999
13
Factoring integers using SIMD sieves (context) - Dixon, Lenstra ACM DBLP
8
Efficient hardware and software implementations of the DES (context) - Davio, Desmedt et al.
8
Analysis and optimization of the TWINKLE factoring device (context) - Lenstra, Shamir - 1999 DBLP
6
personal communication (context) - Gallant - 1999
5
Cracking DES (context) - Foundation - 1998 ACM
5
Exposing the Mythical MIPS Year (context) - Silverman - 1999 ACM DBLP
4
Algorithms for quantum computing: discrete logarithms and fa.. (context) - Shor - 1994
4
personal communication (context) - Menezes - 1999
3
Future Resiliency and High Security Systems (context) - Johnson - 1999
3
RSA Laboratories Cryptobytes (context) - Kocher, DES - 1999
3
personal communication (context) - Zimmermann - 1999
3
letter to the editor of IEEE Computer (context) - Montgomery - 1999
3
personal communication (context) - Leyland - 1999
3
rump session presentation at Crypto (context) - Silverman
3
Factoring integers using the TWINKLE device (context) - Shamir - 1999
3
personal communication (context) - Wiener - 1999
2
Katholieke Universiteit Leuven
- Bosselaers, hashing et al. - 1997
2
BNR Inc (context) - Diffie - 1980
2
Chip designers look for life after silicon (context) - hold, explosive et al. - 1999
1
155-172 (context) - Nechaev, of et al. - 1968
1
Faster attakcs on elliptic curve cryptosystems (context) - Wiener, Zuccherato - 1999
www.counterpane.com/speed.html
http://jya.com/nsa-study.htm
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosavvy.com/):
Selecting Cryptographic Key Sizes - Lenstra, Verheul (2001)
(Correct)
Computational Methods in Public Key Cryptology - Lenstra (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC