Hashing into Hessian Curves
From MaRDI portal
Publication:3011918
DOI10.1007/978-3-642-21969-6_17zbMath1280.94050OpenAlexW2211728331MaRDI QIDQ3011918
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21969-6_17
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (13)
Unnamed Item ⋮ Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings ⋮ \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves ⋮ Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves ⋮ Unnamed Item ⋮ Injective encodings to binary ordinary elliptic curves ⋮ Improved elliptic curve hashing and point representation ⋮ Indifferentiable deterministic hashing to elliptic and hyperelliptic curves ⋮ The geometry of some parameterizations and encodings ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ EMBEDDING FINITE FIELDS INTO ELLIPTIC CURVES ⋮ The geometry of flex tangents to a cubic curve and its parameterizations ⋮ Uniform encodings to elliptic curves and indistinguishable point representation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorization of polynomials over finite fields
- Factorization of trinomials over Galois fields of characteristic 2
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
- Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
- How to Hash into Elliptic Curves
- On a theorem of Stickelberger
- On hashing into elliptic curves
- Efficient Arithmetic on Hessian Curves
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Rational Points on Certain Hyperelliptic Curves over Finite Fields
- New Formulae for Efficient Elliptic Curve Arithmetic
- Algorithmic Number Theory
This page was built for publication: Hashing into Hessian Curves