Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ueli M. Maurer / rank
Normal rank
 
Property / author
 
Property / author: Ueli M. Maurer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality testing and Abelian varieties over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distinguishing prime numbers from composite numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Factored Random Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring with Cyclotomic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieve algorithms for perfect power testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generation of random numbers that are probably prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: SECURITY OF NUMBER THEORETIC PUBLIC KEY CRYPTOSYSTEMS AGAINST RANDOM ATTACK, I / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Primality Criteria and Factorizations of 2 m ± 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a new primality test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms in \(\mathrm{GF}(p)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Error Estimates for the Strong Probable Prime Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary methods in the study of the distribution of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of primes <i>p</i> for which <i>p+a</i> has a large prime factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest prime factor of <i>p</i> + <i>a</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Strong Pseudoprimes to Several Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability that a Random Probable Prime is Composite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a simple factorization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality of the number of points on an elliptic curve over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring integers with elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riemann's hypothesis and tests for primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and comparison of two efficient probabilistic primality testing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast verification, testing, and generation of large primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing logarithms over&amp;lt;tex&amp;gt;GF(p)&amp;lt;/tex&amp;gt;and its cryptographic significance (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular values of Euler's function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of divisors of a natural number having the form \(p-1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic algorithm for testing primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime numbers and computer methods for factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A p + 1 Method of Factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks concerning the M.I.T. public-key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Values Taken Many Times by Euler's Phi-Function / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:09, 23 May 2024

scientific article
Language Label Description Also known as
English
Fast generation of prime numbers and secure public-key cryptographic parameters.
scientific article

    Statements

    Fast generation of prime numbers and secure public-key cryptographic parameters. (English)
    0 references
    0 references
    1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references