4. Conclusion
RSA and Diffie-Hellman algorithms are at the heart of modern communication protocols. According to ICSI Certificate Notary ( https://notary.icsi.berkeley.edu/ ), 90% of certificates used for encrypted exchanges on the Internet in July 2020 used RSA keys, and Diffie-Hellman key exchange is required for SSH (secure shell), TLS 1.3 (the latest version of the SSL/TLS protocol for encrypting e-mail and Internet exchanges), and IPsec (for virtual private networks).
Setting new records for factoring and discrete logarithm calculation is the best way to encourage users of these protocols to update key sizes in favor of more secure values. While official recommendations since 2010 are at least 2,048 bits for RSA and Diffie-Hellman keys, many sites still use smaller keys: Qualys...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference
This article is included in
Security of information systems
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Conclusion
Bibliography
- (1) - AGENCE NATIONALE DE LA SÉCURITÉ DES SYSTÈMES D'INFORMATION - Référentiel général de sécurité, v2.03, Annexe B1. - Téléchargeable via https://www.ssi.gouv.fr/uploads/2014/11/RGS_v-2-0_B1.pdf (2014).
Websites
Computations of discrete logarithms, Laurent Grémy :
Wikipedia Integer factorization records :
https://en.wikipedia.org/wiki/Integer_factorization_records
Wikipedia RSA numbers...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference