IJPAMR International Journal of Pure and Applied Mathematics Research 2789-9160 SvedbergOpen ijpamr-2-1-005 10.51483/IJPAMR.2.1.2022.65-73 Research Paper A Theoretical Approach on Deterministic and Probabilistic Prime Numbers TiwariSumit 1 * KushwahaAtin 2 1Department of Computer Science and Engineering, Rajkiya Engineering College, Kannauj, Uttar Pradesh, India. E-mail: tsumit1199@gmail.com 2Department of Computer Science and Engineering, Rajkiya Engineering College, Kannauj, Uttar Pradesh, India. E-mail: atinkushwaha2000@gmail.com *Corresponding author: Sumit Tiwar, Department of Computer Science and Engineering, Rajkiya Engineering College, Kannauj, Uttar Pradesh, India. E-mail: tsumit1199@gmail.com 04 2022 2 1 65 73 Abstract

This survey paper is based on prime numbers and primality test. Prime numbers are building block of number theory. Prime numbers play a vital role in number theory, there applications are mostly found in cryptography. It is very difficult to find whether a number is prime or not whenever the number is too big. To overcome this problem there are various algorithms. This paper is written in context of prime numbers that explains about prime and some of their testing methods like Fermat’s primality test, AKS Algorithm, Chinese primality test and also the Lucas test.

 Keywords Prime numbers Number theory Cryptography Algorithms References AgrawalManindra., Neeraj KayalNitin Saxena. (2004). PRIMES is in P. Annals of mathematics, 160(2), 781–793. Akgul, BilgeE.S. et al. (2006). Probabilistic CMOS Technology: A Survey and Future Directions. Very Large Scale Integration, IFIP International Conference on. IEEE. Bernstein, DanielJ. (2004). Distinguishing Pime Numbers From Composite Numbers: The State of the Art in 2004. URL: http://cr.yp.to/papers.html#prime2004, 23. BombieriE.HaroldDavenport. (1966). Small Differences Between Prime Numbers. Proc. R. Soc. Lond. A, 293(1432), 1–18. BrentRichard P. (1990). Primality Testing and Integer Factorisation, Australian Academy of Science Annual General Meeting Symposium on the Role of Mathematics in Science, Canberra Proceedings, 14–26. CouveignesJean-Marc., TonyEzome.ReynaldLercier. (2012). A Faster Pseudo-Primality Test. Rendiconti del Circolo Matematico di Palermo, 61(2), 261–278. CrandallRichard.CarlB. Pomerance. (2006). Prime Numbers: A Computational Perspective, 182. Springer Science & Business Media. DixonJohn D. (1984). Factorization and Primality Tests. The American Mathematical Monthly, 91(6), 333–352. Gordon, DanielM. (1998). A Survey of Fast Exponentiation Methods. J. Algorithm, 27(1), 129–146. Gunasekara, ARC De VasA.A.C.A. Jayathilake. and PereraA.A.I. (2015). Survey on Prime Numbers, Elixir Appl. Math. 88, 36296–36301. Heath-BrownD.R. (1982). Prime Numbers in Short Intervals and a Generalized Vaughan Identity. Canadian Journal of Mathematics, 34(6), 1365–1377. HuaLuogeng. (2009). Additive Theory of Prime Numbers, 13. American Mathematical Soc. Translations of Mathematical Monographs, 13, 190p. HusseinNidal Hassan., Ahmed KhalidKhalid Khanfar. (2016). A Survey of Cryptography Cloud Storage Techniques. Google Scholar. Ingham, Albert EdwardAlbertEdward, Ingham. (1990). The Distribution of Prime Numbers. No. 30. Cambridge University Press. KandolaShelley. (2013). A Survey of Cryptographic Algorithms. Diss. St. Lawrence University. Lenstra, ArjenK. (1990). Primality Testing. Cryptology and Computational Number Theory, Proc. Symp.Appl.Math., 42. LenstraH.W. (1981). Primality Testing Algorithms [after Adleman, Rumely and Williams]. Séminaire Bourbaki vol. 1980/81 Exposés 561-578. Springer, Berlin, Heidelberg, 243–257. MorainFrançois. (1993). Pseudoprimes: A Survey of Recent Results. Eurocode ‘92, 207–215. Springer, Vienna. PomeranceCarl. (2010). Primality Testing: Variations on a Theme of Lucas. Congr Numer, 201, 301–312. ŠleževicieneR., SteudingJ.TurskieneS. (2004). Recent Breakthrough in Primality Testing. Nonlinear Analysis, 9(2), 171–184. Wells, DavidG. (2005), Prime numbers. John Wiley & Sons, Inc., Hoboken, New Jersey. WilliamsH.C. (1982). The Influence of Computers in the Development of Number Theory. Computers & Mathematics with Applications, 8(2), 75–93. Williams, HughC. (1984). An Overview of Factoring. Advances in Cryptology. Springer, Boston, MA.