The Lucas-Lehmer Test For Mersenne Primes

A Mersenne prime is in the form of 2^S−1. Known Mersenne prime numbers are 2³−1, 2⁵−1, 2⁷−1, 2¹³−1, 2¹⁷−1, 2¹⁹−1, 2³¹−1, 2⁶¹−1, 2⁸⁹−1, 2¹⁰⁷−1 and 2¹²⁷−1. Overall Mersenne primes are efficient in their implementation. This article outlines the the Lucas-Lehmer test to test for a Mersenne prime number. A fast elliptic curve name FourQ uses a prime of 2¹²⁷-1:

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Prof Bill Buchanan OBE

Prof Bill Buchanan OBE

7K Followers

Professor of Cryptography. Serial innovator. Believer in fairness, justice & freedom. Based in Edinburgh. Old World Breaker. New World Creator. Building trust.