Mersenne Factorization Factory

DOI10.1007/978-3-662-45611-8_19zbMath1306.11098OpenAlexW38530703MaRDI QIDQ2938854

Arjen K. Lenstra, Thorsten Kleinjung, Joppe W. Bos

Publication date: 16 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45611-8_19

zbMATH Keywords

Mersenne numbersblock Wiedemann algorithmfactorization factoryspecial number field sieve

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (6)

Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Updating key size estimations for pairings ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment ⋮ A Brief History of Pairings

This page was built for publication: Mersenne Factorization Factory