### A Simple Derivation for the Frobenius Pseudoprime Test

Daniel Loebenberger

##### 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.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
primality testing
Contact author(s)
daniel @ bit uni-bonn de
History
Short URL
https://ia.cr/2008/124

CC BY

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},
note = {\url{https://eprint.iacr.org/2008/124}},
url = {https://eprint.iacr.org/2008/124}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.