Name
Abstract | ||
|---|---|---|
Huff curves are well known for efficient arithmetics to their group law. In this paper, we propose two deterministic encodings from $$\\mathbb {F}_q $$Fq to generalized Huff curves. When $$q\\equiv 3 \\pmod 4$$q﾿3mod4, the first deterministic encoding based on Skalpa's equality saves three field squarings and five multiplications compared with birational equivalence composed with Ulas' encoding. It costs three multiplications less than simplified Ulas map. When $$q\\equiv 2 \\pmod 3$$q﾿2mod3, the second deterministic encoding based on calculating cube root costs one field inversion less than Yu's encoding at the price of three field multiplications and one field squaring. It costs one field inversion less than Alasha's encoding at the price of one multiplication. We estimate the density of images of these encodings with Chebotarev density theorem. Moreover, based on our deterministic encodings, we construct two hash functions from messages to generalized Huff curves indifferentiable from a random oracle. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-38898-4_2 | Inscrypt |
Keywords | Field | DocType |
Elliptic curves, Generalized Huff curves, Character sum, Hash function, Random oracle | Discrete mathematics,Cube root,Character sum,Random oracle,Multiplication,Equivalence (measure theory),Hash function,Mathematics,Elliptic curve,Encoding (memory) | Conference |
Volume | ISSN | Citations |
9589 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoyang He | 1 | 5 | 1.80 |
| Wei Yu | 2 | 9 | 5.26 |
| Kunpeng Wang | 3 | 15 | 6.71 |