Statistics and Probability African Society Editions

Chapter 29. A Note on Encoding and Hashing into Elliptic and Hyperelliptic Curves

Nafissatou DIARRA, Michel SECK, and Djiby SOW

Full-text: Open access

Abstract

We give an (up-to-date) overview of existing encoding and hash functions into (hyper)elliptic curves. We also design an indifferentiable hash function into the Jacobian of certain families of hyperelliptic curves of genus $g\leq 5$ using the unified formulas of Seck and Diarra (AFRICACRYPT-2018).

Chapter information

Source
Hamet Seydi, Gane Samb Lo, Aboubakary Diakhaby, eds., A Collection of Papers in Mathematics and Related Sciences, a Festschrift in Honour of the Late Galaye Dia, (Calgary, Alberta, 2018), 615-648

Dates
First available in Project Euclid: 26 September 2019

Permanent link to this document
https://projecteuclid.org/euclid.spaseds/1569509489

Digital Object Identifier
doi:10.16929/sbs/2018.100-06-01

Subjects
Primary: 11T71: Algebraic coding theory; cryptography 14G50: Applications to coding theory and cryptography [See also 94A60, 94B27, 94B40]

Keywords
elliptic curve cryptography hyperelliptic curves encoding hashing

Citation

DIARRA, Nafissatou; SECK, Michel; SOW, Djiby. Chapter 29. A Note on Encoding and Hashing into Elliptic and Hyperelliptic Curves. A Collection of Papers in Mathematics and Related Sciences, 615--648, Statistics and Probability African Society, Calgary, Alberta, 2018. doi:10.16929/sbs/2018.100-06-01. https://projecteuclid.org/euclid.spaseds/1569509489


Export citation