arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.03758cs.CR
收藏

高次三变量多项式同余的后量子加密算法:BS密码系统与BS密钥生成

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

Nicholas J. Daras

AI总结:

本文基于三变量Beal-Schur同余在有限域上的非平凡解构造BS后量子加密算法及密钥生成方法,其安全性依赖于参数p、q、r、N的无限选择空间。

摘要:

我们将构造基于三变量多项式Beal-Schur同余的后量子加密算法。在给出Beal猜想的一个证明并引用其在离散对数及其若干推广问题不可解的选定情形中的一些应用之后,我们将研究Beal猜想在整数有限域上的适当版本的表述与有效性。与无限情形相反,我们将证明相应的Beal-Schur同余方程 $x^{p}+y^{q}\equiv z^{r} (mod \mathcal{N})$ 在有限域 $\mathbb{Z}_{\mathcal{N}} $ 中具有非平凡解,对于所有足够大的不整除乘积 $xyz$ 的素数 $\mathcal{N}$,在指数 $p$、$q$ 和 $r$ 满足某些互素性条件下成立。我们将应用这一结果来生成所谓的BS密码系统,即基于Beal-Schur同余方程的简单且安全的后量子加密算法,以及新的密码密钥生成方法,其后量子算法加密安全性依赖于参数 $p$、$q$、$r$、$\mathcal{N}$ 具有无限多种选择。

英文摘要:

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}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑