Prime numbers and computer methods for factorization
DOI10.1007/978-0-8176-8298-9zbMath1272.11001OpenAlexW4300211240MaRDI QIDQ5894277
Publication date: 19 September 2011
Published in: Modern Birkhäuser Classics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-8176-8298-9
tablesalgorithmscryptographyRiemann zeta-functionprimes in arithmetic progressionsprimality testsdistribution of prime numberscomputational number theorynumber field sievegaps between primeselliptic curve methodfactorization methodsPASCALprime counting functiontable of prime factors of Fermat numbers
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Primes in congruence classes (11N13) Software, source code, etc. for problems pertaining to number theory (11-04) Distribution of primes (11N05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization; primality (11A51) Primes (11A41) Factorization (11Y05) Primality (11Y11) Computational number theory (11Yxx)
Related Items (2)
This page was built for publication: Prime numbers and computer methods for factorization