Prime-number algorithm for public-key systems
type: Item
instance of: scholarly article
title: Prime-number algorithm for public-key systems
zbMATH Open document ID: 0858.11065
DOI: 10.1007/BF02366625
author: A. M. Kudin
published in: Cybernetics and Systems Analysis
publication date: 1996-11-21T00:00:00Z
review text: The problem of generating prime numbers for use in cryptographic systems is addressed. A few of the known primality tests are reviewed, including pseudoprime, deterministic and hypothesis tests. Other techniques that have been used for generating primes are briefly noted and a new recursive technique described.
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 948643
zbMATH Keywords: public-key systems
zbMATH Keywords: pseudoprime test
zbMATH Keywords: deterministic test
zbMATH Keywords: hypothesis test
zbMATH Keywords: generating prime numbers
zbMATH Keywords: cryptographic systems
reviewed by: Ian Blake
describes a project that uses: ECPP
MaRDI profile type: Publication
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Q4328115
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Q4046106
cites work: Factoring with Cyclotomic Polynomials
cites work: Analysis of a simple factorization algorithm
cites work: A Comparison of Machine Organizations by Their Performance of the Iterative Solution of Linear Equations
cites work: Q3762404
cites work: Every Prime Has a Succinct Certificate
cites work: Q3746881
cites work: On distinguishing prime numbers from composite numbers
cites work: Factoring integers with elliptic curves
cites work: Elliptic Curves and Primality Proving
cites work: Q3745895
cites work: Q3822228
cites work: Factorization and Primality Tests
cites work: Explicit Primality Criteria for h ⋅2 k ± 1
cites work: Q5520724
cites work: The Carmichael Numbers up to 10 15
cites work: The Probability that a Random Probable Prime is Composite
cites work: Probabilistic algorithm for testing primality
cites work: Average Case Error Estimates for the Strong Probable Prime Test
cites work: The generation of random numbers that are probably prime
cites work: The Pseudoprimes to 25 ⋅10 9
cites work: On Strong Pseudoprimes to Several Bases
cites work: Q3208051
cites work: Q3363459
cites work: Some remarks concerning the M.I.T. public-key cryptosystem
full work available at URL: https://doi.org/10.1007/bf02366625
OpenAlex ID: W2062972101
description: scientific article; zbMATH DE number 948643