Strategy of relations collection in factoring RSA modulus

DOI10.1007/978-3-319-29814-6_16zbMATH Open1384.11108OpenAlexW2465894108MaRDI QIDQ2801769FDOQ2801769

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

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

zbMATH Keywords

multiplicationgeneral number field sieveprime factorshighly parallel structurerelations collection

Mathematics Subject Classification ID

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

Cites Work

• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
• Factorization of a 768-Bit RSA Modulus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Factoring estimates for a 1024-bit RSA modulus
• Title not available (Why is that?)

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)