RSA-240 factorization
New factorization and discrete logarithm record computations
Research and innovation REF: IN131 V2
RSA-240 factorization
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?

2. RSA-240 factorization

The main steps of the algebraic screen can be divided as follows. The proximity between the algebraic screen for factoring an integer n, and the algebraic screen for calculating discrete logarithms in /p is such that this list is relevant in both situations:

  • the polynomial selection stage. This involves selecting a pair of irreducible polynomials with integer coefficients, denoted f0[x] and f1[x]...

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