Cryptographic Public Key Length Prediction

被引:0
|
作者
Amain, M. [1 ]
Batten, L. M. [1 ]
机构
[1] Deakin Univ, Sch Informat Technol, Geelong, Vic 3217, Australia
关键词
Public key length; RSA cryptosystem; Moore's Law;
D O I
10.1007/978-3-662-48683-2_3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In the late 1900s, suitable key lengths were determined by cryptographers who considered four main features based on implementation, expected lifespan and associated security. By 2010, recommendations are aimed at governmental and commercial institutions, which take into consideration practical implementations that provide data security. By aggregating the key length predictive data since 1985, we notice that while the figures proposed between 1990 and 2010 increase linearly, those proposed for 2010 to 2050 do not. This motivates us to re-think the factors used as a basis for key length predictions and we initiate this re-evaluation in this paper. Focusing first on implementation, we clarify the meaning of Moore's Law by going back to his original papers and commentary. We then focus on the period 2010-2015, when non-linearity appears, and test Moore's Law based on three different hardware platforms. Our conclusion is that current assumptions about Moore's law are still reasonable and that non-linearity is likely to be caused by other factors which we will investigate in future work.
引用
收藏
页码:27 / 35
页数:9
相关论文
共 50 条
  • [31] Secret Key Specification for a Variable-Length Cryptographic Cellular Automata Model
    Oliveira, Gina M. B.
    Martins, Luiz G. A.
    Ferreira, Giordano B.
    Alt, Leonardo S.
    PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XI, PT II, 2010, 6239 : 381 - 390
  • [32] A New Fast Public key Cryptographic Construction Based on CRT and NTRU
    Li Xinshe
    Zhang Lei
    Zhang Ying
    Zhao Zhihui
    ICCSE 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION: ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, 2008, : 1151 - 1153
  • [33] Semidirect Products of Finite Groups in Public-Key Cryptographic Protocols
    Lanel, G. H. J.
    Jinasena, T. M. K. K.
    Welihinda, B. A. K.
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2022, 38 (05) : 1035 - 1050
  • [34] On the Implications from Updatable Encryption to Public-Key Cryptographic Primitives
    Tanishita, Yuichi
    Hayashi, Ryuya
    Ishii, Ryu
    Matsuda, Takahiro
    Matsuura, Kanta
    INFORMATION SECURITY AND PRIVACY, PT I, ACISP 2024, 2024, 14895 : 303 - 323
  • [35] A security analysis of public key cryptographic systems used for electronic signature
    Neacșu, Eugen
    Șchiopu, Paul
    UPB Scientific Bulletin, Series C: Electrical Engineering and Computer Science, 2021, 83 (01): : 135 - 146
  • [36] Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)
    Nishimaki, Ryo
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT I, 2020, 12550 : 179 - 209
  • [37] An Improved Public Key Cryptographic Algorithm Based on Chebyshev Polynomials and RSA
    Zhang, Chunfu
    Liang, Yanchun
    Tavares, Adriano
    Wang, Lidong
    Gomes, Tiago
    Pinto, Sandro
    SYMMETRY-BASEL, 2024, 16 (03):
  • [38] A Survey of Public-Key Cryptographic Primitives in Wireless Sensor Networks
    Shim, Kyung-Ah
    IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2016, 18 (01): : 577 - 601
  • [39] Cryptographic key recovery
    AlSalqan, YY
    PROCEEDINGS OF THE SIXTH IEEE COMPUTER SOCIETY WORKSHOP ON FUTURE TRENDS OF DISTRIBUTED COMPUTING SYSTEMS, 1997, : 34 - 37
  • [40] Electromagnetic Analysis against Public-Key Cryptographic Software on Embedded OS
    Uno, Hajime
    Endo, Sho
    Homma, Naofumi
    Hayashi, Yu-ichi
    Aoki, Takafumi
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2015, E98B (07) : 1242 - 1249