1. Home
  2. IT
  3. Security of information systems
  4. New factorization and discrete logarithm record computations

  5. RSA-240 factorization

Article | REF: IN131 V2

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

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

Français

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.

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

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

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

Subscribe now!

Ongoing reading
RSA-240 factorization
Outline