Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Smart, N. (ed.).: ECRYPT II yearly report on algorithms and keysizes. In: European Network of Excellence in Cryptology, ICT-2007-216676 (2011–2012)
Naslund, M. (ed.): ECRYPT yearly report on algorithms and keysizes. In: European Network of Excellence in Cryptology, IST-2002-507932 (2007–2008)
Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 446–465. Springer, Heidelberg (2000)
Lenstra, A.K.: Key Lengths. The Handbook of Information Security (2004). Thirty-two pages
Bohr, M.: Moore’s Law in the Innovation Era. In: SPIE Advanced Lithography on International Society for Optics and Photonics, p. 797402 (8 pages) (2011)
Orman, H., Hoffman, P.: Determining strengths for public keys used for exchanging symmetric keys. RFC 3766, April 2004. https://tools.ietf.org/html/rfc3766#page-11(Accessed 13 July 2015)
NIST.: Cryptographic algorithms and key sizes for personal identity verification. 800–78-4, May 2015. http://dx.doi.org/10.6028/NIST.SP.800-78-4
ANSSI 2010, Mécanismes cryptographiques - Règles et recommandations, Rev. 1.20, ANSSI, January 2010 and Rev. 2.03, ANSSI, February 2014
BSI 2009 and 2014, Bundesnetzagentur für Elektrizität, Gas, Telekommunikation, Post und Eisenbahnen, Algorithms for Qualified Electronic Signatures, BNetzA, BSI, January 2014. Version 1.4 (2009) and version 13.1.2014 (2014)
Damien, G., Quisquater, J.-J.: BlueKrypt Cryptographic Key Length Recommendation, v.28.6, February 2015. http://www.keylength.com/en/8/
Moore, G.E.: Cramming more components onto integrated circuits. Reprinted from Electronics, 38(8), pp. 114, 19 April 1965. Reprinted in IEEE Solid-State Circuits Newsletter 3(20), pp. 33–35 (2006)
Purohit, I., Somani, R.K.: Hybrid Cryptography Algorithm based on prime factorization. Int. J. Recent Dev. Eng. Technol. 2(2), 90–96 (2014). www.ijrdet.com. (ISSN 2347–6435)
Dhakar, R.S., Gupta, A.K., Sharma, P.: Modified RSA Encryption Algorithm (MREA). In: 2nd IEEE International Conference on Advanced Computing & Communication Technologies (ACCT), pp. 426–429. IEEE (2012)
Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC press (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amain, M., Batten, L.M. (2015). Cryptographic Public Key Length Prediction. In: Niu, W., et al. Applications and Techniques in Information Security. ATIS 2015. Communications in Computer and Information Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48683-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-48683-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48682-5
Online ISBN: 978-3-662-48683-2
eBook Packages: Computer ScienceComputer Science (R0)