SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms

DOI10.1007/978-3-642-41224-0_4MaRDI QIDQ3189989zbMATH OpenOpenAlexFDO

Authors Binanda Sengupta, Abhijit Das

Publication date 15 September 2014

Published in Security, Privacy, and Applied Cryptography Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41224-0_4

zbMATH Keywords

advanced vector extensionsinteger factorizationmultiple-polynomial quadratic sieve methodnumber-field sieve methodsievingsingle instruction multiple datastreaming SIMD extensions

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1394326
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• scientific article; zbMATH DE number 862681
• Simple parallel algorithms for primality testing and integer factorization
• scientific article; zbMATH DE number 1424533
• scientific article; zbMATH DE number 554529
• scientific article; zbMATH DE number 4165009
• scientific article; zbMATH DE number 708866
• Factoring with the quadratic sieve on large vector computers

Cited in

(3)

• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
• scientific article; zbMATH DE number 1394326 (Why is no real title available?)

This page was built for publication: SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms

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