Publication

Factorization of a 768-Bit RSA Modulus

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Dag Arne Osvik, Patric Zimmermann
2010
Conference paper

Abstract

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.

Official source

https://infoscience.epfl.ch/record/164552?ln=en

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 Chatbot

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.

Factorization of a 768-Bit RSA Modulus

Graph Chatbot

Chat with Graph Search

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

Computation of a 768-Bit Prime Field Discrete Logarithm

On the Analysis of Public-Key Cryptologic Algorithms

On the Analysis of Public-Key Cryptologic Algorithms

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

Computation of a 768-Bit Prime Field Discrete Logarithm