Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields
ACISP(1997)
摘要
We show how to use cyclotomic polynomials to construct subgroups of multiplicative groups of finite fields that allow very efficient implementation of discrete logarithm based public key cryptosystems. Depending on the type of application and implementation, the resulting schemes may be up to three times faster than the fastest known schemes of comparable security that use more conventional choices of subgroups or finite fields.
更多查看译文
PDF
PPT
代码
数据
原文链接
标签
评论
作者解读
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn