Efficient Generation of Prime Numbers (2000)

by Marc Joye , Pascal Paillier , Serge Vaudenay
Citations:12 - 4 self

Active Bibliography

3 Fast Generation of Prime Numbers of Portable Devices: An Update – Marc Joye, Pascal Paillier - 2006
2 DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3 – François Morain - 1991
2 Atkin's test: news from the front – Franqois Morain, Dipartement De Mathkmatiques, Universitk Claude Bernard - 1990
GENERALISED MERSENNE NUMBERS REVISITED – Robert Granger, Andrew Moss
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
5 Elliptic Curves, Primality Proving And Some Titanic Primes – François Morain - 1989
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
1 Cryptology – Prof Ronald Rivest, L. Rivest
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
Codes -- The Guide to Secrecy . . . – Richard A. Mollin
1 Efficient Arithmetic Modulo Minimal Redundancy Cyclotomic Primes – Robert Granger, Andrew Moss, Nigel P. Smart
4 Blinded-Key Signatures: securing private keys embedded in mobile agents – Lucas C. Ferreira, Ricardo Dahab - 2002
46 Some integer factorization algorithms using elliptic curves – Richard P. Brent - 1986
24 On the Utility of Distributed Cryptography in P2P and MANETs: the Case of Membership Control – Maithili Narasimha, Gene Tsudik, Jeong Hyun Yi
11 Elliptic Curve Public Key Cryptosystems - an introduction – Erik De Win, Bart Preneel - 1997
39 On the Performance of Signature Schemes based on Elliptic Curves – Erik De Win, Serge Mister, Bart Preneel, Michael Wiener - 1998
4 An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates – Ivan Bjerre Damgård, Gudmund Skovbjerg Frandsen - 2001
A Simpli ed Quadratic Frobenius Primality Test – Martin Seysen, Devrient Gmbh - 2005
Close to Uniform Prime Number Generation With Fewer Random Bits – Pierre-alain Fouque, Mehdi Tibouchi