Results 31 to 40 of about 7,094,319 (54)
THE LUCAS-PRATT PRIMALITY TREE
, 2008 . In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained through the prime factorization of p − 1 and a primitive root for p. V.
Jonathan Bayless
core
, 2015 Primzahltests (d.s. Tests, die untersuchen, ob eine für gewöhnlich große Zahl eine Primzahl ist oder nicht) sind in der heutigen Zeit zu einer wichtigen Grundlage für die Kryptographie und damit für unseren Alltag (z.B. E-Mails) geworden.
Koller, Gernot
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
core +3 more sources
Existence of primitive divisors of Lucas and Lehmer numbers
Journal Fur Die Reine Und Angewandte Mathematik, 2001 Article dans revue scientifique avec comité de lecture.We prove that for~${n>30}$, every~$n$-th Lucas and Lehmer number has a primitive divisor.
Hanrot, Guillaume +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches: