A deterministic primality test for N = K p^ℓ - 1 requiring one modular exponentiation in quadratic fields, achieving Õ(log² N) complexity, plus an analogue of Korselt's criterion.
Comp.73(2004), no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A primality test for $Kp^\ell - 1$ numbers
A deterministic primality test for N = K p^ℓ - 1 requiring one modular exponentiation in quadratic fields, achieving Õ(log² N) complexity, plus an analogue of Korselt's criterion.