You are looking at a specific version 20080317:212920 of this paper.
See the latest version.
Paper 2008/124
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.
Metadata
- 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
- 2008-03-17: received
- Short URL
- https://ia.cr/2008/124
- License
-
CC BY