Work

Novel Performant Primality Test on a Pell’s Cubic

Year: 2025

Type: article

Abstract: Primality testing is an especially useful topic for public-key cryptography. In this paper, a novel primality test algorithm based on Pell’s cubic will be introduced, and its necessary primality conditions will be proved using three integer sequences connected to operations applied in the projectivization of Pell’s cubic. The number of operations involved in the test grows linearly with respect to the bit length $$\log _2(n)$$ log 2 ( n ) of the input integer n. The algorithm is deterministic for integers less than $$2^{36}.$$ 2 36 .

Source: Mediterranean Journal of Mathematics

DOI: 10.1007/s00009-025-02839-w

Authors: Luca Di Domenico, Nadir Murru

Institution: University of Trento

Language: English

Topic: Analytic Number Theory Research

Subfield: Algebra and Number Theory

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,190

Funder: Università degli Studi di Trento