Fast generation of prime numbers and secure public-key cryptographic parameters.
type: Item
instance of: scholarly article
title: Fast generation of prime numbers and secure public-key cryptographic parameters.
zbMATH Open document ID: 1036.11533
DOI: 10.1007/BF00202269
published in: Journal of Cryptology
publication date: 1995-01-01T00:00:00Z
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 784594
author: Ueli M. Maurer
MaRDI profile type: Publication
cites work: Primality testing and Abelian varieties over finite fields
cites work: On distinguishing prime numbers from composite numbers
cites work: Q4091421
cites work: How to Generate Factored Random Numbers
cites work: Q4335193
cites work: Factoring with Cyclotomic Polynomials
cites work: Q4888749
cites work: Sieve algorithms for perfect power testing
cites work: Q3715207
cites work: The generation of random numbers that are probably prime
cites work: SECURITY OF NUMBER THEORETIC PUBLIC KEY CRYPTOSYSTEMS AGAINST RANDOM ATTACK, I
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Q3995106
cites work: New Primality Criteria and Factorizations of 2 m ± 1
cites work: Implementation of a new primality test
cites work: Discrete logarithms in \(\mathrm{GF}(p)\)
cites work: Q4744327
cites work: Average Case Error Estimates for the Strong Probable Prime Test
cites work: On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory
cites work: Elementary methods in the study of the distribution of prime numbers
cites work: New directions in cryptography
cites work: Q4279676
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Q4204221
cites work: On the number of primes p for which p+a has a large prime factor
cites work: Probabilistic encryption
cites work: On the largest prime factor of p + a
cites work: On Strong Pseudoprimes to Several Bases
cites work: The Probability that a Random Probable Prime is Composite
cites work: Analysis of a simple factorization algorithm
cites work: Q3792737
cites work: Primality of the number of points on an elliptic curve over a finite field
cites work: Q4035724
cites work: Q3726186
cites work: Q3974091
cites work: Q4341796
cites work: Q4385516
cites work: Q4036860
cites work: Factoring integers with elliptic curves
cites work: Q3973160
cites work: Q4011774
cites work: Q4940702
cites work: Q4037493
cites work: Q3360980
cites work: Q3141896
cites work: Q4940703
cites work: Riemann's hypothesis and tests for primality
cites work: Evaluation and comparison of two efficient probabilistic primality testing algorithms
cites work: Q4036863
cites work: Fast verification, testing, and generation of large primes
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: Popular values of Euler's function
cites work: Q3974092
cites work: On the number of divisors of a natural number having the form \(p-1\)
cites work: Every Prime Has a Succinct Certificate
cites work: Probabilistic algorithm for testing primality
cites work: Prime numbers and computer methods for factorization
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q3210171
cites work: Fast multiplication of large numbers
cites work: Q4341727
cites work: A Fast Monte-Carlo Test for Primality
cites work: A p + 1 Method of Factoring
cites work: Some remarks concerning the M.I.T. public-key cryptosystem
cites work: Values Taken Many Times by Euler's Phi-Function