CryptoDB
A Simple Derivation for the Frobenius Pseudoprime Test
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17801, title={A Simple Derivation for the Frobenius Pseudoprime Test}, booktitle={IACR Eprint archive}, keywords={foundations / primality testing}, url={http://eprint.iacr.org/2008/124}, note={ daniel@bit.uni-bonn.de 13955 received 17 Mar 2008}, author={Daniel Loebenberger}, year=2008 }