Primality tests for specific classes of $N=k\cdot 2^m \pm 1$

TL;DR

This paper introduces polynomial time primality tests tailored for specific classes of numbers of the form k·2^m ± 1, enhancing the efficiency of primality testing for these special cases.

Contribution

The paper presents new polynomial time primality tests specifically designed for numbers of the form k·2^m ± 1, expanding the toolkit for primality verification in these classes.

Findings

Developed primality tests for numbers of the form k·2^m ± 1

Tests operate in polynomial time for these classes

Improves efficiency over general primality testing methods

Abstract

Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.