Constructing a hash function from plaintext to Huff curves

DOI10.3969/J.ISSN.0253-2778.2014.10.006MaRDI QIDQ5257451zbMATH OpenFDO

Authors Wei Yu, Kun Peng Wang, Bao Li

Publication date 29 June 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.0253-2778.2014.10.006

zbMATH Keywords

hash functionHuff curvepower analysis

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Hashing into generalized Huff curves
• How to Hash into Elliptic Curves
• Hashing into Hessian curves
• Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
• Efficient indifferentiable hashing into ordinary elliptic curves

Cited in

(1)

• How to Build a Hash Function from Any Collision-Resistant Function

This page was built for publication: Constructing a hash function from plaintext to Huff curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5257451)