一种基于矩形矩阵半环上改进矩阵幂函数的后量子密钥协商协议
A Post Quantum Key Agreement Protocol Based on a Modified Matrix Power Function over a Rectangular Matrices Semiring
AI总结:
本文提出一种基于矩形矩阵半环上改进矩阵幂函数的后量子密钥协商协议,通过用矩形矩阵替代方阵并采用完全随机值,在降低计算复杂度的同时增强熵值和抗线性化攻击能力。
摘要:
我们提出了一种改进的后量子版本的 Sakalauskas 矩阵幂函数密钥协商协议,使用矩形矩阵代替原始的方阵。Sakalauskas 矩阵幂函数是一种高效且安全的共享密钥生成方式,而使用矩形矩阵提供了额外的灵活性和安全性。该方法通过允许更小的随机整数矩阵来降低计算复杂度,同时保持高水平的安全性。我们不依赖具有特殊格式的矩阵来实现交换性,而是在这些结构上使用完全随机的值,从而增加其熵。在密钥协商协议中使用矩形矩阵的另一个优势是,它们能够更好地抵御各种线性化攻击。
英文摘要:
We present an improved post-quantum version of Sakalauskas matrix power function key agreement protocol, using rectangular matrices instead of the original square ones. Sakalauskas matrix power function is an efficient and secure way to generate a shared secret key, and using rectangular matrices provides additional flexibility and security. This method reduces the computational complexity by allowing smaller random integer matrices while maintaining a high level of security. We dont rely on matrices with special formatting to achieve commutativity, instead, we use full random values on those structures, increasing their entropy. Another advantage of using rectangular matrices over key agreement protocols is that they offer better protection against various linearization attacks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。