The Center for Education and Research in Information Assurance and Security (CERIAS)

The Center for Education and Research in
Information Assurance and Security (CERIAS)
Center for Education and Research in Information Assurance and Security

Is there a shortage of primes for cryptography?

Author

Samuel S Wagstaff Jr

Entry type

article

Abstract

Algorithms for choosing random large primes generally choose primes with certain properties, such as having few bits in their binary representation. The paper uses theorems about the distribution of prime numbers to study whether there are enough primes with these properties so that they cannot be guessed by an attacker.

Date

2006 – 11

URL

http://ijns.nchu.edu.tw/

Key alpha

Wagstaff

Note

At the home page for the electronic journal look for volume 3, number 3, pages 296--299.

Number

3

Pages

296--299

Volume

3

Affiliation

Purdue University

Publication Date

2006-11-01

Language

English

Subject

distribution of prime numbers with certain requirements on their binary representation.

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.