Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
DOI10.1007/s00145-024-09490-wMaRDI QIDQ6192060
Publication date: 11 March 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
conic bundlesCipolla-Lehmer-Müller's algorithmgeneralized Châtelet surfacesgenus 2 curves of zero tracegluing elliptic curveshashing to elliptic curveshighly 2-adic fields
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) [https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=%22Curves+of+arbitrary+genus+or+genus+%28%0D%0Ae+1%29+over+global+fields%22&go=Go Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved elliptic curve hashing and point representation
- Points rationnels sur certaines courbes et surfaces cubiques
- Quadratic Diophantine equations. With a foreword by Preda Mihăilescu
- Rational points on some pencils of conics with 6 singular fibres
- On the computation of square roots in finite fields
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
- Guide to Pairing-Based Cryptography
- Mathematics of Public Key Cryptography
- On taking square roots without quadratic nonresidues over finite fields
- Structure computation and discrete logarithms in finite abelian $p$-groups
- How to Hash into Elliptic Curves
- Curves of genus 2 with group of automorphisms isomorphic to 𝐷₈ or 𝐷₁₂
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- UNIRATIONALITY OF CUBIC HYPERSURFACES
- Points on elliptic curves over finite fields
- Efficient solution of rational conics
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Large torsion subgroups of split Jacobians of curves of genus two or three
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
- Quadratic families of elliptic curves and unirationality of degree 1 conic bundles
- Algorithmic Number Theory
- A survey of elliptic curves for proof systems
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
This page was built for publication: Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
