[1]
Caldwell, Chris K. and Xiong, Yeng, What is the Smallest Prime?, Journal of Integer Sequences, (2012),
https://cs.uwaterloo.ca/journals/JIS/VOL15/Caldwell1/cald5.pdf
References Bibliography
[2]
Diffie, Whitfield and Hellman, Martin E., New directions in cryptography, Institute of Electrical and Electronics Engineers. Transactions on Information Theory, IT-22, (1976), no. 6, 644-654,
https://ee.stanford.edu/~hellman/publications/24.pdf
[3]
ElGamal, Taher, A public key cryptosystem and a signature scheme based on discrete logarithms, Institute of Electrical and Electronics Engineers. Transactions on Information Theory, 31, (1985), no. 4, 469-472,
http://dx.doi.org/10.1109/TIT.1985.1057074
[4]
Oliveira e Silva, Tomàs and Herzog, Siegfried and Pardi, Silvio Empirical verification of the even Goldbach conjecture and computation of prime gaps up to \(4\cdot 10^{18}\) Mathematics of Computation, 83 (2014) no. 288 2033--2060
https://doi.org/10.1090/S0025-5718-2013-02787-1
[5]
Atkins, Derek and Graff, Michael and Lenstra, Arjen K. and Leyland, Paul C. The magic words are squeamish ossifrage (extended abstract) in Advances in cryptology---{ASIACRYPT} ’94 ({W}ollongong, 1994) Lecture Notes in Comput. Sci. 917 263--277 Springer, Berlin (1995)
[6]
Saidak, Filip, A new proof of Euclid’s theorem, The American Mathematical Monthly, 113, (2006), no. 10, 937-938,
http://dx.doi.org/10.2307/27642094
[7]
Euclid, The thirteen books of Euclid’s Elements, Translated with introduction and commentary by Thomas L. Heath, 2nd ed, Dover Publications, Inc., New York, (1956)
[8]
Gauss, Carl Friedrich, Disquisitiones arithmeticae Translated and with a preface by Arthur A. Clarke, Revised by William C. Waterhouse, Cornelius Greither and A. W. Grootendorst and with a preface by Waterhouse, Springer-Verlag, New York, (1986)
[9]
Rivest, R. L. and Shamir, A. and Adleman, L., A method for obtaining digital signatures and public-key cryptosystems, Communications of the Association for Computing Machinery, 21, (1978), no. 2, 120-126,
http://dx.doi.org/10.1145/359340.359342
[10]
Gardner, M., Mathematical games: A new kind of cipher that would take millions of years to break, Scientific American, (August 1977), 120-124
[11]
Weber, H., Leopold Kronecker, Jahresbericht der Deutschen Mathematiker Vereinigung, 2, (1891), 5-31
[12]
Merkle, Ralph C, Secure Communications Over Insecure Channels, Communications of the ACM, 21, (1978), no. 4, 294-299
[13]
Rosen, Kenneth H., Discrete Mathematics and Applications, (2012), 978-0-07-338309-5 McGraw-Hill Higher Education
[14]
Bounded gaps between primes Annals of Mathematics 179 (2014) 1121-1174
https://www.jstor.org/stable/24522787
