Post-quantum encryption algorithms of high-degree 3-variable polynomial congruences: BS cryptosystems and BS key generation

TL;DR

This paper introduces post-quantum encryption algorithms based on three-variable polynomial Beal-Schur congruences, proving their applicability and security relying on solutions over finite fields, and proposing new cryptographic key generation methods.

Contribution

It constructs novel post-quantum encryption algorithms using Beal-Schur congruences and proves the existence of solutions over finite fields, enabling secure cryptographic schemes.

Findings

Beal-Schur congruence equations have solutions in finite fields for large primes.

New cryptosystems based on Beal-Schur congruences are proposed.

Post-quantum security relies on parameter choices with infinite options.

Abstract

We will construct post-quantum encryption algorithms based on three-variable polynomial Beal-Schur congruence. After giving a proof of Beal's conjecture and citing some applications of it to selected cases where the discrete logarithm and some of its generalizations are unsolvable problems, we will investigate the formulation and validity of an appropriate version of the Beal's conjecture on finite fields of integers. In contrast to the infinite case, we will show that the corresponding Beal-Schur congruence equation $x^{p}+y^{q}\equiv z^{r} (mod \mathcal{N})$ has non-trivial solutions into the finite field $\mathbb{Z}_{\mathcal{N}} $, for all sufficiently large primes $\mathcal{N}$ that do not divide the product $xyz$, under certain mutual divisibility conditions of the exponents $p$, $q$ and $r$. We will apply this result to generate the so-called BS cryptosystems, i.e., simple and secure post-quantum encryption algorithms based on the Beal-Schur congruence equation, as well as new cryptographic key generation methods, whose post-quantum algorithmic encryption security relies on having an infinite number of options for the parameters $p$, $q$, $r$, $\mathcal{N}$.