Uniform encodings to elliptic curves and indistinguishable point representation

DOI10.1007/s10623-020-00753-8zbMath1439.14110OpenAlexW3019743795MaRDI QIDQ782846

Reza Rezaeian Farashahi, Mojtaba Fadavi

Publication date: 29 July 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00753-8

zbMATH Keywords

elliptic curve cryptographyencoding function to elliptic curvespoint representation

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Uses Software

• Elligator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved elliptic curve hashing and point representation
• CSIDH: an efficient post-quantum commutative group action
• Injective encodings to binary ordinary elliptic curves
• Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
• Binary Elligator Squared
• Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings
• Hashing into Hessian Curves
• Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
• How to Hash into Elliptic Curves
• Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Reducing elliptic curve logarithms to logarithms in a finite field
• Points on elliptic curves over finite fields
• Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
• Huff’s Model for Elliptic Curves
• Rational Points on Certain Hyperelliptic Curves over Finite Fields
• Injective Encodings to Elliptic Curves
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Algorithmic Number Theory
• Theory of Cryptography