References

[Adam] Adams, Carlisle, Lloyd Steve: Understanding Public Key Infrastructure Concepts, Standards & Deployment, Macmillan Technical Publishing, Indianapolis, 1999.

[AgKS] Agrawal, Maninda, Kayal Neeraj, Saxena Nitin: PRIMES is in P, Indian Institute of Technology, 2003.

[BaSh] Bach, Eric, Shallit Jeffrey: Algorithmic Number Theory, Vol. 1, Efficient Algorithms, MIT Press, Cambridge (MA), London, 1996.

[BCGP] Beauchemin, Pierre, Brassard Gilles, Crépeau Claude, Goutier Claude, Pomerance Carl: The generation of random numbers that are probably prime, Journal of Cryptology, Vol. 1, No. 1, pp. 53–64, 1988.

[Bern] J. Bernstein Daniel: Proving primality after Agrawal–Kayal–Saxena, Draft paper, http://cr.yp.to/papers.html#aks, 2003.

Get Cryptography in C and C++, Second Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.