Counterexamples for Frobenius primality test
From MaRDI portal
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.
This page was built for publication: Counterexamples for Frobenius primality test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6243757)
