Results 51 to 60 of about 100 (72)
A Treatise on the Theory of Mersenne Numbers and Primality Testing
This thesis explores Mersenne numbers, numbers of the form $2^p-1$ where $p$ is prime. We are particularly concerned with when such numbers are themselves prime.
Robeson, Tanner
core
From Worst to Average Case to Incremental Search Bounds of the Strong Lucas Test
The strong Lucas test is a widely used probabilistic primality test in cryptographic libraries. When combined with the Miller-Rabin primality test, it forms the Baillie-PSW primality test, known for its absence of false positives, undermining the ...
Wunder, Gerhard, Einsele, Semira
core
Investigations Into Web Science and the Concept of Web Life
Our increasing ability to construct large and complex computer and information systems suggests that the classical manner in which such systems are understood and architected is inappropriate for the open and unstructured manner in which they are often ...
Tetlow, Philip David
core
A simpler alternative to Lucas-Lehmer-Riesel primality test. [PDF]
IACR Cryptol. ePrint Arch., 2023 This paper investigates application of Morrison primality test to numbers of $k \cdot 2^n-1$ form and finds a simple general formula, which is equivalent to Lucas–Lehmer and Lucas–Lehmer–Riesel primality ...
Pavel Atnashev
openaire +2 more sources
Primality testing of large numbers in Maple
Computers and Mathematics With Applications, 1995 Primality testing of large numbers is very important in many areas of mathematics, computer science and cryptography, and in recent years, many of the modern primality testing algorithms have been incorporated in Computer Algebra Systems (CAS) such as ...
Yan, S.Y.
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Primality tests, linear recurrent sequences and the Pell equation
Ramanujan Journal, 2021Simone Dutto +2 more
exaly