Conclusion
New factorization and discrete logarithm record computations
Research and innovation REF: IN131 V2
Conclusion
New factorization and discrete logarithm record computations

Authors : Fabrice BOUDOT, Pierrick GAUDRY, Aurore GUILLEVIC, Nadia HENINGER, Emmanuel THOMÉ, Paul ZIMMERMANN

Publication date: January 10, 2021 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

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...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?


Article included in this offer

"Security of information systems"

( 86 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details