Paper 2008/124 Original: eprint.iacr.org/2008/124 ↗
A Simple Derivation for the Frobenius Pseudoprime Test
Abstract
Probabilistic compositeness tests are of great practical importance in cryptography. Besides prominent tests (like the well-known Miller-Rabin test) there are tests that use Lucas-sequences for testing compositeness. One example is the so-called Frobenius test that has a very low error probability. Using a slight modification of the above mentioned Lucas sequences we present a simple derivation for the Frobenius pseudoprime test in the version proposed by Crandall and Pommerance.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2008-03-17: last updated
- 2008-03-17: published
- Short URL
- https://ia.cr/2008/124
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/124,
author = {Daniel Loebenberger},
title = {A Simple Derivation for the Frobenius Pseudoprime Test},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/124},
year = {2008},
url = {https://eprint.iacr.org/2008/124}
}