Strategy of relations collection in factoring RSA modulus

DOI10.1007/978-3-319-29814-6_16MaRDI QIDQ2801769zbMATH OpenOpenAlexFDO

Authors Guo Qiang Bai, Haibo Yu

Publication date 21 April 2016

Published in Information and Communications Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29814-6_16

zbMATH Keywords

multiplicationgeneral number field sieveprime factorshighly parallel structurerelations collection

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 799759
• Algorithm for factoring some RSA and Rabin moduli
• Factoring RSA moduli with primes sharing bits in the middle
• Analysis of Bernstein’s Factorization Circuit
• On a strategy in the sieving procedure for the factorization of large natural numbers

Cites work

• scientific article; zbMATH DE number 475433 (Why is no real title available?)
• scientific article; zbMATH DE number 475436 (Why is no real title available?)
• scientific article; zbMATH DE number 1504795 (Why is no real title available?)
• scientific article; zbMATH DE number 799759 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
• Factoring estimates for a 1024-bit RSA modulus
• Factorization of a 768-Bit RSA Modulus

This page was built for publication: Strategy of relations collection in factoring RSA modulus

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