Publication

Computation of a 768-Bit Prime Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung
2017
Conference Papers

Abstract

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly discusses the cryptologic relevance of the result.

Official source

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.

Computation of a 768-Bit Prime Field Discrete Logarithm

Chat with Graph Search

Brief Announcement: Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation

Accelerating Spectral Clustering under Fairness Constraints

SOMOphilic alkyne vs radical-polar crossover approaches: The full story of the azido-alkynylation of alkenes