Paper 2023/195 Original: eprint.iacr.org/2023/195 ↗
A simpler alternative to Lucas–Lehmer–Riesel primality test
Abstract
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 tests.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2023-02-14: last updated
- 2023-02-14: published
- Short URL
- https://ia.cr/2023/195
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/195,
author = {Pavel Atnashev},
title = {A simpler alternative to Lucas–Lehmer–Riesel primality test},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/195},
year = {2023},
url = {https://eprint.iacr.org/2023/195}
}