非奇异循环矩阵群中的离散对数问题
The discrete logarithm problem in the group of non-singular circulant matrices
摘要:
离散对数问题是公钥密码学的核心问题之一。本文研究有限域上循环矩阵群上的离散对数问题。这就产生了安全和快速的公钥密码系统。
英文摘要:
The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key cryptosystems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。