Year: 2013
Type: preprint
Abstract: At present one can not find a single counterexample to even a simplest version of Frobenius primality test. The assessment of probability of the mistake, presented in [I.B. Damgard and G.S.Frandsen, Journal of Cryptology, 2006] is strongly overestimated. In the present paper, the properties of simple divisors of FPP-numbers are proved. The lower bound for FPP are given.
Source: arXiv (Cornell University)
Author: Khashin, Sergey
Institution: Ivanovo State University
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2288166237