Strategy of Relations Collection in Factoring RSA Modulus

DOI10.1007/978-3-319-29814-6_16zbMath1384.11108OpenAlexW2465894108MaRDI QIDQ2801769

Guoqiang Bai, Hai-Bo 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
• Factorization of a 768-Bit RSA Modulus
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Strategy of Relations Collection in Factoring RSA Modulus