Primality tests for specific classes of N=k⋅ 2^m ± 1

2015/06/10 by Predrag Terzić, Terzic, Predrag
Computer Science · Mathematics · #Analytic Number Theory Research #Chaos-based Image/Signal Encryption #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1506.03444

openalex publication_date 2015/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Polynomial time primality tests for specific classes of numbers of the form k⋅ 2^m ± 1 are introduced.

Related

• Primality tests for Fermat numbers and 2^(2k+1)±2^(k+1)+1
• Primality test for numbers of the form (2p)²ⁿ+1
• A primality test for Kpⁿ+1 numbers
• Primality tests for 2^kn-1 using elliptic curves
• Explicit primality criteria for h⋅2ⁿ±1