Cryptographic transformations over polyadic rings
基于多元环的密码学变换
Steven Duplij, Qiang Guo, Na Fu
AI总结 提出基于多元环的密码学范式,利用参数到元数的映射Φ(a,b)构建非单射、非满射且多值的复杂关系,设计两种加密过程,通过多元量化模拟信号传输信息,增强安全性。
Comments 21 pages, revtex 4.2
详情
本文介绍了一种基于非派生多元代数结构的新型密码学范式。传统密码系统依赖于群、环或域内的二元运算,其良好理解的特性可被密码分析利用。为克服这些漏洞,我们提出转向多元环,它通过允许更高元数的运算来推广经典环:一个$m$元加法和一个$n$元乘法。我们方法的基础是多元整数的构造——普通整数的同余类,赋予这样的$m$元和$n$元运算。一个关键创新是参数到元数的映射$\Phi(a,b)=(m,n)$,它将定义同余类的参数$(a,b)$与代数闭包所需的特定元数联系起来。该映射在数学上是复杂的:它是非单射、非满射且多值的。这种复杂、非唯一的关系构成了所提密码系统安全性的核心。我们提出了两种具体的加密过程,利用这种结构,将明文编码在多元环的参数中,并通过多元量化的模拟信号传输信息。在一种方法中,明文与加法元数$m_{i}$相关联,并通过此类信号的求和来保护;在另一种方法中,明文与环参数$a_{i}$相关联,并通过它们的乘法来保护。在这两种情况下,多元运算的“量化”性质生成方程组,对于拥有正确密钥的合法接收者来说直接明了,但对于没有密钥的攻击者来说极其困难。由此产生的框架有望大幅提高密码安全性。这项工作为这类新型加密方案奠定了理论基础,并突显了它们在构建鲁棒的下一代密码协议方面的潜力。
This article introduces a novel cryptographic paradigm based on nonderived polyadic algebraic structures. Traditional cryptosystems rely on binary operations within groups, rings, or fields, whose well-understood properties can be exploited in cryptanalysis. To overcome these vulnerabilities, we propose a shift to polyadic rings, which generalize classical rings by allowing operations of higher arity: an $m$-ary addition and an $n$-ary multiplication. The foundation of our approach is the construction of polyadic integers -- congruence classes of ordinary integers endowed with such $m$-ary and $n$-ary operations. A key innovation is the parameter-to-arity mapping $Φ(a,b)=(m,n)$, which links the parameters $(a,b)$ defining a congruence class to the specific arities required for algebraic closure. This mapping is mathematically intricate: it is non-injective, non-surjective, and multivalued. This complex, non-unique relationship forms the core of the proposed cryptosystem's security. We present two concrete encryption procedures that leverage this structure by encoding plaintext within the parameters of polyadic rings and transmitting information via polyadically quantized analog signals. In one method, plaintext is linked to the additive arity $m_{i}$ and secured using the summation of such signals; in the other, it is linked to a ring parameter $a_{i}$ and secured using their multiplication. In both cases, the "quantized" nature of polyadic operations generates systems of equations that are straightforward for a legitimate recipient with the correct key but exceptionally difficult for an attacker without it. The resulting framework promises a substantial increase in cryptographic security. This work establishes the theoretical foundation for this new class of encryption schemes and highlights their potential for constructing robust, next-generation cryptographic protocols.