Mersenne factorization factory

DOI10.1007/978-3-662-45611-8_19MaRDI QIDQ2938854zbMATH OpenOpenAlexFDO

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

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

block Wiedemann algorithmfactorization factoryMersenne numbersspecial number field sieve

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• A Kilobit Special Number Field Sieve Factorization
• scientific article; zbMATH DE number 20453
• scientific article; zbMATH DE number 475436
• scientific article; zbMATH DE number 475434
• scientific article; zbMATH DE number 475432

Cited in

(8)

• Updating key size estimations for pairings
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• Computation of a 30750-bit binary field discrete logarithm
• A brief history of pairings
• A Kilobit Special Number Field Sieve Factorization
• Computation of a 768-bit prime field discrete logarithm
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Discrete logarithm factory

This page was built for publication: Mersenne factorization factory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938854)