Fast Generation of Provable Primes Using Search in Arithmetic Progressions

Preda Mihailescu. Fast Generation of Provable Primes Using Search in Arithmetic Progressions. In Yvo Desmedt, editor, Advances in Cryptology - CRYPTO 94, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1994, Proceedings. Volume 839 of Lecture Notes in Computer Science, pages 282-293, Springer, 1994. [doi]

Abstract

Abstract is missing.