Prime-number algorithm for public-key systems

DOI10.1007/BF02366625MaRDI QIDQ1816016zbMATH OpenOpenAlexFDO

Authors A. M. Kudin

Publication date 21 November 1996

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02366625

zbMATH Keywords

hypothesis testcryptographic systemspublic-key systemsdeterministic testgenerating prime numberspseudoprime test

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Recommendations

• Fast generation of prime numbers and secure public-key cryptographic parameters.
• On using primes for public key encryption systems
• scientific article; zbMATH DE number 4103163
• scientific article; zbMATH DE number 1759305
• Recognizing primes

Cites work

• scientific article; zbMATH DE number 3649960 (Why is no real title available?)
• scientific article; zbMATH DE number 3981247 (Why is no real title available?)
• scientific article; zbMATH DE number 3982512 (Why is no real title available?)
• scientific article; zbMATH DE number 4012739 (Why is no real title available?)
• scientific article; zbMATH DE number 4095550 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 738921 (Why is no real title available?)
• scientific article; zbMATH DE number 3232841 (Why is no real title available?)
• A Comparison of Machine Organizations by Their Performance of the Iterative Solution of Linear Equations
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Analysis of a simple factorization algorithm
• Average Case Error Estimates for the Strong Probable Prime Test
• Elliptic Curves and Primality Proving
• Every Prime Has a Succinct Certificate
• Explicit Primality Criteria for h ⋅2 k ± 1
• Factoring integers with elliptic curves
• Factoring with Cyclotomic Polynomials
• Factorization and Primality Tests
• On Strong Pseudoprimes to Several Bases
• On distinguishing prime numbers from composite numbers
• Probabilistic algorithm for testing primality
• Problems of the theory of prime numbers connected with the classical theorems of P. L. Chebyshev
• Some remarks concerning the M.I.T. public-key cryptosystem
• The Carmichael Numbers up to 10 15
• The Probability that a Random Probable Prime is Composite
• The Pseudoprimes to 25 ⋅10 9
• The generation of random numbers that are probably prime

Cited in

(9)

• Recognizing primes
• Fast Generation of Prime Numbers on Portable Devices: An Update
• Applying evolutionary algorithm to public key cryptosystems
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Algorithm for generating primes \(p\) and \(q\) such that \(q\) divides \(p^4 \pm p^3 + p^2 \pm p + 1\)
• Prime number generators
• On using primes for public key encryption systems
• scientific article; zbMATH DE number 4103163 (Why is no real title available?)
• scientific article; zbMATH DE number 5590087 (Why is no real title available?)

Describes a project that uses

Uses Software

• ECPP

This page was built for publication: Prime-number algorithm for public-key systems

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