Study on Deterministic and Probabilistic Computation of Primality Test

7 Pages Posted: 14 Jun 2019

See all articles by Jyotshna Rajput

Jyotshna Rajput

Rajkiya Engineering College

Abhishek Bajpai

Rajkiya Engineering College

Date Written: February 24, 2019

Abstract

Every natural number greater than 1 is either prime or composite. Those numbers which have only two factors i.e., 1 and itself are considered as prime and rest are considered as composite numbers. The property of a number for being prime is called primality. In this survey paper we will deal with the algorithms that can check whether the number is prime or not i.e., primality test. This study is the detailed survey of probabilistic and deterministic algorithms like Fermat’s theorem of primality test, AKS theorem, Miller Rabin’s test, Solvay Strassen’s theorem etc. We will discuss different parameters regarding algorithms which are best for testing large prime numbers. Many aspects will be considered while discussing these algorithms.

Suggested Citation

Rajput, Jyotshna and Bajpai, Abhishek, Study on Deterministic and Probabilistic Computation of Primality Test (February 24, 2019). Proceedings of International Conference on Sustainable Computing in Science, Technology and Management (SUSCOM), Amity University Rajasthan, Jaipur - India, February 26-28, 2019, Available at SSRN: https://ssrn.com/abstract=3358737 or http://dx.doi.org/10.2139/ssrn.3358737

Jyotshna Rajput

Rajkiya Engineering College

Ambedkar Nagar
India

Abhishek Bajpai (Contact Author)

Rajkiya Engineering College ( email )

Kannauj
India

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
226
Abstract Views
845
Rank
245,368
PlumX Metrics