A Deterministic Cryptographic Prime Generation Chain over Monogenic Cubic Number Fields and their Generalizations

TL;DR

This paper introduces a deterministic prime generation method using monogenic cubic number fields, enabling efficient prime testing from a seed prime with broad generalizations.

Contribution

It presents a novel prime construction technique based on monogenic pure cubic fields, extending to arbitrary prime degree fields, with a simple, efficient primality test.

Findings

Constructs primes from seed primes using algebraic number theory.

The primality test requires only a single modular exponentiation.

The method extends to pure number fields of any prime degree.

Abstract

Generating primes is a fundamental problem in modern cryptography. Deterministic primality tests work well for special integers such as Mersenne or Proth primes, but these forms are quite restrictive. In this paper, we give a direct method to construct new primes from known ones. Starting with a seed prime $q \equiv 1 \pmod{3}$, we construct an integer $N \equiv 1 \pmod{3}$ satisfying $(2N + 1)^2 \equiv -3 \pmod{q}$. We then prove that $N$ is prime using the structure of monogenic pure cubic fields $K = \mathbb{Q}(\sqrt[3]{d})$. The resulting test requires only a single modular exponentiation and runs in $\tilde{\mathcal{O}}(\log^2 N)$ time. Finally, we show how this construction extends to pure number fields of arbitrary prime degree.