Fast verification, testing, and generation of large primes

DOI10.1016/0304-3975(79)90002-1MaRDI QIDQ1132906zbMATH OpenOpenAlexFDO

Authors David A. 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)

Cites work

• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3092634 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• Every Prime Has a Succinct Certificate
• On factorisation, with a suggested new approach
• On the computational power of pushdown automata
• Some Factorizations of 2 n ± 1 and Related Results
• The Lattice Point Covering Theorem for Rectangles

Cited in

(2)

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

This page was built for publication: Fast verification, testing, and generation of large primes

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