Analysis of Bernstein’s Factorization Circuit

DOI10.1007/3-540-36178-2_1MaRDI QIDQ4412786zbMATH OpenOpenAlexFDO

Authors Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer

Publication date 16 July 2003

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

Full work available at URL https://doi.org/10.1007/3-540-36178-2_1

zbMATH Keywords

factorizationmesh routingnumber field sieveRSA

Mathematics Subject Classification ID

Factorization (11Y05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cryptography (94A60)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 1759342
• Batch NFS
• scientific article; zbMATH DE number 1024054
• Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit

Cited in

(1)

• Strategy of relations collection in factoring RSA modulus

This page was built for publication: Analysis of Bernstein’s Factorization Circuit

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