构造从字符串到C_(34)曲线的散列函数

Construct Hash Function from Plaintext to C_(34) Curves

该文利用求立方根的方法构造了一个从有限域Fq映射到C34曲线上的确定函数,其时间复杂性是O(log3q).利用这个确定的函数构造了从字符串到C34曲线上的散列函数.在相同的素域上,与2009年Icart T构造的到椭圆曲线上的散列函数相比,开立方的方法在计算速度上提高超过30%.并且作者利用该确定函数构造了与随机谕言不可区分的函数.

This paper proposes a deterministic construction of an encoding from a finite filed C34 to a C34 curve using finding cube roots method, where the time complexity is O（log^3q）. Based on the deterministic encoding, we construct a hash function from plaintext to C34 curves. The new method provides up more than 30% speed improvements compare to Icart T. ＇s hash function in Crypto 2009 on the same prime filed. Moreover, we provide a new function indifferentiable from a random oracle based on our deterministic encoding.