scientific article; zbMATH DE number 1394326

MaRDI QIDQ4934743zbMATH OpenFDO

Authors Brandon Dixon, Arjen K. Lenstra

Publication date 1 February 2000

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
• The Multiple Polynomial Quadratic Sieve
• scientific article; zbMATH DE number 862681
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• scientific article; zbMATH DE number 20453

Cited in

(10)

• Efficient massively parallel implementation of some combinatorial algorithms
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• Factoring by simulated subsets
• SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
• scientific article; zbMATH DE number 5117572 (Why is no real title available?)
• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
• scientific article; zbMATH DE number 1088933 (Why is no real title available?)
• scientific article; zbMATH DE number 799759 (Why is no real title available?)
• scientific article; zbMATH DE number 862681 (Why is no real title available?)
• Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation

This page was built for publication:

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