Efficient Generation of Prime Numbers

Efficient Generation of Prime Numbers (2000)

by Marc Joye , Pascal Paillier , Serge Vaudenay

Citations:

11 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Generation of Prime Numbers	user correction - Legacy Corrections
AUTHOR NAME	Marc Joye	SVM HeaderParse 0.1
AUTHOR ADDR	1 Gemplus Card International, France	SVM HeaderParse 0.1
AUTHOR NAME	Pascal Paillier	SVM HeaderParse 0.1
AUTHOR ADDR	1 Gemplus Card International, France	SVM HeaderParse 0.1
AUTHOR NAME	Serge Vaudenay	SVM HeaderParse 0.1
AUTHOR ADDR	2 École Polytechnique Fédérale de Lausanne, Switzerland	SVM HeaderParse 0.1
ABSTRACT	The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appearing during various cryptographic setups. Surprisingly, despite decades of intense mathematical studies on primality testing and an observed progressive intensification of cryptographic usages, prime number generation algorithms remain scarcely investigated and most real-life implementations are of rather poor performance. Common generators typically output a n-bit prime in heuristic average complexity O(n^4) or O(n^4/log n) and these figures, according to experience, seem impossible to improve significantly: this paper rather shows a simple way to substantially reduce the value of hidden constants to provide much more efficient prime generation algorithms. We apply our...	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0