Fast verification, testing, and generation of large primes

DOI10.1016/0304-3975(79)90002-1zbMath0421.10007OpenAlexW2031342296MaRDI QIDQ1132906

David Alan Plaisted

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90002-1

zbMATH Keywords

generationstochastic methodlarge primesprime testing method

Mathematics Subject Classification ID

Primes (11A41) Algorithms in computer science (68W99)

Related Items

Complete divisibility problems for slowly utilized oracles, Fast generation of prime numbers and secure public-key cryptographic parameters.

Cites Work

• On the computational power of pushdown automata
• Every Prime Has a Succinct Certificate
• A Fast Monte-Carlo Test for Primality
• On factorisation, with a suggested new approach
• Some Factorizations of 2 n ± 1 and Related Results
• The Lattice Point Covering Theorem for Rectangles
• Unnamed Item
• Unnamed Item
• Unnamed Item