摘要
首次构造了从有限域Fq到Huff曲线的确定函数,其时间复杂性为O(log3q).在此基础上构造了从字符串到Huff曲线的散列函数.该散列函数的构造为基于身份协议的构造奠定了基础.其在中国椭圆曲线密码算法标准SM2推荐的素域上的运行时间为557.8μs.
A deterministic function with its time complexity being O(log^3q) was constructed for the first time from a finite field Fq to Huff curves. Based on this function, construct a hash function from plaintext into Huff curves. The Hash function laid the foundation for identity-based protocols on elliptic curves and its experimental time cost on the elliptic curve of the Chinese elliptic curve standard SM2 is 557.8 μs.
基金
国家重点基础研究发展(973)计划(2013CB338001)
中国高技术研究发展(863)计划(2013AA014002)
国家自然科学基金(61272040
61070171)
中国科学院战略性先导专项(XDA06010702)资助