Selecting cryptographic key sizes

被引：360
作者：
Lenstra, AK
Verheul, ER
机构：
[1] Citibank NA, Mendham, NJ 07945 USA
[2] PricewaterhouseCoopers, GRMS Crypto Grp, NL-5644 KE Eindhoven, Netherlands
来源：
JOURNAL OF CRYPTOLOGY | 2001年 / 14卷 / 04期
关键词：
symmetric key length; public key length; RSA; ElGamal; elliptic curve cryptography; Moore's law;
D O I：
10.1007/s00145-001-0009-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：255 / 293
页数：39
相关论文
共 42 条
  • [1] WHY CRYPTOSYSTEMS FAIL
    ANDERSON, RJ
    [J]. COMMUNICATIONS OF THE ACM, 1994, 37 (11) : 32 - 40
  • [2] [Anonymous], RSA CRYPTO BYTES
  • [3] Biham E, 1997, LECT NOTES COMPUT SC, V1267, P260
  • [4] Blaze Matt, 1996, Technical Report
  • [5] BOSSELAERS A, 1997, EUR 97 MAY 13
  • [6] BRAZIER JRT, POSSIBLE NSA DECRYPT
  • [7] Cavallar S, 2000, LECT NOTES COMPUT SC, V1807, P1
  • [8] DAVIO M, 1984, P CRYPT 84
  • [9] EXHAUSTIVE CRYPT-ANALYSIS OF NBS DATA ENCRYPTION STANDARD
    DIFFIE, W
    HELLMAN, ME
    [J]. COMPUTER, 1977, 10 (06) : 74 - 84
  • [10] DIFFIE W, 1980, BNR INC REPORT
12345