Abstract
We will investigate two well-known square root finding algorithms which return the roots of some quadratic residue modulo a prime p. Instead of running the mechanisms modulo p we will investigate their behaviour when applied modulo any integer n. In most cases the results will not be the square roots, when n is composite. Since the results obtained can easily be verified for correctness we obtain a very rapid probable prime test. Based on the square root finding mechanisms we will introduce two pseudoprimality tests which will be shown to be extremely fast and very efficient. Moreover, the proposed test for n ≡1 mod 4 will be proven to be even more efficient than Grantham’s suggestion in [5].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
