Fast verification, testing, and generation of large primes
type: Item
instance of: scholarly article
title: Fast verification, testing, and generation of large primes
zbMATH Open document ID: 0421.10007
DOI: 10.1016/0304-3975(79)90002-1
published in: Theoretical Computer Science
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 11A41
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3654214
zbMATH Keywords: generation
zbMATH Keywords: large primes
zbMATH Keywords: stochastic method
zbMATH Keywords: prime testing method
author: David A. Plaisted
MaRDI profile type: Publication
full work available at URL: 0304-3975(79)90002-1
OpenAlex ID: W2031342296
cites work: On the computational power of pushdown automata
cites work: Some Factorizations of 2 n ± 1 and Related Results
cites work: Q5831393
cites work: Q5585020
cites work: On factorisation, with a suggested new approach
cites work: The Lattice Point Covering Theorem for Rectangles
cites work: Every Prime Has a Succinct Certificate
cites work: Q4164569
cites work: A Fast Monte-Carlo Test for Primality
description: scientific article; zbMATH DE number 3654214