Prime-number algorithm for public-key systems

DOI10.1007/BF02366625zbMath0858.11065OpenAlexW2062972101MaRDI QIDQ1816016

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

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

Uses Software

• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distinguishing prime numbers from composite numbers
• Factoring integers with elliptic curves
• The generation of random numbers that are probably prime
• Probabilistic algorithm for testing primality
• Analysis of a simple factorization algorithm
• Elliptic Curves and Primality Proving
• Explicit Primality Criteria for h ⋅2 k ± 1
• Average Case Error Estimates for the Strong Probable Prime Test
• The Carmichael Numbers up to 10 15
• A Comparison of Machine Organizations by Their Performance of the Iterative Solution of Linear Equations
• Factorization and Primality Tests
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Factoring with Cyclotomic Polynomials
• Some remarks concerning the M.I.T. public-key cryptosystem
• The Pseudoprimes to 25 ⋅10 9
• Every Prime Has a Succinct Certificate
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The Probability that a Random Probable Prime is Composite
• On Strong Pseudoprimes to Several Bases

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