On Generation of Probable Primes by Incremental Search-Reference-Cited by-同舟云学术

On Generation of Probable Primes by Incremental Search

Published: Issue: Volume: Page:358-370
ISSN:
Container-title:Advances in Cryptology — CRYPTO’ 92
language:
Short-container-title:

Author:

Brandt Jørgen,Damgård Ivan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48071-4_26.pdf

Reference10 articles.

1. E. Bach: Realistic analysis of som randomized algorithms, Proc. of STOC 87.

2. J. Brandt, I.B. Damgård and P. Landrock: Speeding up prime number generation, Proc. of Asiacrypt 91, Springer Verlag Lecture Note Series.

3. L. Cohen and A. Wigderson: Dispersers, deterministic amplification, and weak random sources, Proc. of FOCS 89.

4. I.B. Damgård, P. Landrock and C. Pomerance: Average case bounds for the strong probable prime test, submitted to Math. Comp., available from authors.

5. P.X. Gallagher: On the distribution of primes in short intervals, Mathematica 23 (1976) pp.4–9.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Average case error estimates of the strong Lucas test;Designs, Codes and Cryptography;2024-01-18

2. How to detect whether Shor’s algorithm succeeds against large integers without a quantum computer;Procedia Computer Science;2021

3. Cryptographic Divergences: New Techniques and New Applications;Lecture Notes in Computer Science;2020

4. Honey Encryption: Security Beyond the Brute-Force Bound;Advances in Cryptology – EUROCRYPT 2014;2014

5. Side-Channel Attack against RSA Key Generation Algorithms;Advanced Information Systems Engineering;2014