Simple parallel algorithms for primality testing and integer factorization

DOI10.1080/0020739930240317MaRDI QIDQ4281819zbMATH OpenOpenAlexFDO

Authors Song Yuan Yan

Publication date 8 September 1994

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739930240317

zbMATH Keywords

algorithmsinteger factorizationprimality testingundergraduate

Mathematics Subject Classification ID

Factorization (11Y05) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 554529
• scientific article; zbMATH DE number 4165009
• Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
• Two fast parallel prime number sieves

Cited in

(7)

• Efficient parallel algorithms to test square-freeness and factorize strings
• Highly parallel computations modulo a number having only small prime factors
• SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
• scientific article; zbMATH DE number 5670033 (Why is no real title available?)
• Efficient address generation for prime factor algorithms (digital signal processing)
• A Performance Analysis of a Simple Prime-Testing Algorithm
• scientific article; zbMATH DE number 3922536 (Why is no real title available?)

This page was built for publication: Simple parallel algorithms for primality testing and integer factorization

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