Publication

A kilobit special number field sieve factorization

Arjen Lenstra, Thorsten Kleinjung, Dag Arne Osvik
2007
Conference Papers

Abstract

We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 21039 -1. Although this factorization is orders of magnitude 'easier' than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of the latter computation. © International Association for Cryptology Research 2007.

Official source

https://infoscience.epfl.ch/entities/publication/820b66d4-6c8e-4655-8928-925b22e7b2a9

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A kilobit special number field sieve factorization

Chat with Graph Search

The double exponential runtime is tight for 2-stage stochastic ILPs

Recoloring subgraphs of K-2n for sports scheduling

Demography of galactic technosignatures