Arjen K. Lenstra, Eric R. Verheul  Home/Search
Context Related
| cryptosavvy.com/Joc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cryptosavvy.com/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this article we o er guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over nite elds and over groups of elliptic curves over prime elds. Our recommendations are based on a set of explicitly formulated parameter settings, combined with existing data points about the cryptosystems. 1 (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):
32.2%: Selecting Cryptographic Key Sizes - Lenstra, Verheul (2001) (Correct)
Active bibliography (related documents): More All
0.5: Integrating Smart Cards into Kerberos - Gaskell (Correct)
0.4: 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)
Similar documents based on text: More All
0.5: The XTR public key system - Lenstra, Verheul (2000) (Correct)
0.5: Analysis of Bernstein's Factorization Circuit - Lenstra, Shamir, Tomlinson.. (2002) (Correct)
0.3: Doing More with Fewer Bits - Brouwer, Pellikaan, Verheul (1999) (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/article/lenstra01selecting.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/article/lenstra01selecting.html" }
Citations (may not include all citations):128 Why cryptosystems fail - Anderson - 1994
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
108 A one round protocol for tripartite Die-Hellman (context) - Joux - 2000
98 Selecting Cryptographic Key Sizes - Lenstra, Verheul
52 Parallel collision search with cryptanalytic applications - van Oorschot, Wiener - 1999
51 Exhaustive cryptanalysis of the NBS Data Encryption Standard (context) - Die, Hellman - 1977
50 Separating Decision Die-Hellman from Die-Hellman in cryptogr.. - Joux, Nguyen - 2000
43 A fast new DES implementation in software - Biham - 1994
41 Minimal key lengths for symmetric ciphers to provide adequat.. (context) - Blaze, Die et al. - 1996
39 The future of integer factorization (context) - Odlyzko - 1995
36 Complexity of a determinate algorithm for the discrete logar.. (context) - Nechaev
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
22 The XTR public key system - Lenstra, Verheul
21 Evidence that XTR is more secure than supersingular elliptic.. (context) - Verheul
20 Faster attacks on elliptic curve cryptosystems - Wiener, Zuccherato
20 A cost-based security analysis of symmetric and asymmetric k.. (context) - Silverman - 2000
14 personal communication (context) - Kocher - 1999
14 Factorization of a 512-bit RSA modulus - Cavallar, Dodson et al.
13 Factoring integers using SIMD sieves (context) - Dixon, Lenstra - 1993
10 RSA Laboratories' Cryptobytes (context) - Shamir, paranoids - 1995
8 Analysis and optimization of the TWINKLE factoring device (context) - Lenstra, Shamir
6 personal communication (context) - Gallant - 1999
5 Cracking DES (context) - Foundation - 1998
5 Exposing the Mythical Mips-Year (context) - Silverman - 1999
4 personal communication (context) - Menezes - 1999
4 Algorithms for quantum computing: discrete logarithms and fa.. (context) - Shor - 1994
3 RSA Laboratories' Cryptobytes (context) - Kocher, DES - 1999
3 personal communication (context) - Leyland
3 letter to the editor of IEEE Computer (context) - Montgomery - 1999
3 rump session presentation at Crypto (context) - Silverman
3 personal communication (context) - Zimmermann - 1999
3 Future Resiliency and High Security Systems (context) - Johnson - 1999
3 personal communication (context) - Wiener - 1999
3 Factoring integers using the TWINKLE device (context) - Shamir - 1999
2 Possible NSA decryption capabilities (context) - Brazier
2 Bell-Northern Research (context) - Wiener, key et al. - 1993
1 The New York Times (context) - hold, explosive et al.
1 rump session presentation at Eurocrypt (context) - Bosselaers, hashing et al. - 1997
1 Ecient hardware and software implementations of the DES (context) - Davio, Desmedt et al. - 1984
1 BNR Inc (context) - Die - 1980
www.simonsingh.com/cipher.htm
www.cryptosavvy.com
www.counterpane.com/speed.html
www.rsa.com
www.wassenaar.org
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosavvy.com/):
Computational Methods in Public Key Cryptology - Lenstra (2001) (Correct)
Selecting Cryptographic Key Sizes - Lenstra, Verheul (1999) (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