Prime Numbers and Computer Methods for Factorization

1994/01/01 by Hans Riesel · 6 citations
Computer Science · Mathematics · #Quantum Computing Algorithms and Architecture #Chaos-based Image/Signal Encryption #advanced mathematical theories

paper · pdf · doi:10.1007/978-1-4612-0251-6

openalex publication_date 1994/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/22

Abstract

In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists

Cited by

• Computational strategies for the Riemann zeta function
• Factorization of the tenth Fermat number
• The impact of 𝜁(𝑠) complex zeros on 𝜋(𝑥) for 𝑥<10^10¹³
• Will a physicist prove the Riemann hypothesis?
• “Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation
• Prime number [wikipedia]