Primality Tests and Use of Primes in Public-Key Systems

Authors:
Peter Landrock
Affiliations:
-
Venue:
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Year:
1999

Citing 5
Cited 0

The generation of random numbers that are probably prime

Journal of Cryptology
Exponentiation cryptosystems on the IBM PC

IBM Systems Journal
Fast generation of secure RSA-moduli with almost maximal diversity

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Speeding up Prime Number Generation

ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Riemann's hypothesis and tests for primality

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the first part of this discussion, we first briefly discuss various prime generation methods, starting with the Rabin-Miller test, and then moving on to a very simple new deterministic test. After that we discuss various ways of constructing so-called strong primes, and why this better be avoided.