Primality and Cryptography.

H. W. Lenstra, Evangelos Kranakis · Mathematics of Computation · 1988

From the Publisher: A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretical study of public key cryptography and pseudorandom generators. Unique in its approach, the book will be a valuable addition to computer literature.

Read the paper · More papers on PaperTik