Decaf: eliminating cofactors through point compression

DOI10.1007/978-3-662-47989-6_34MaRDI QIDQ3457135zbMATH OpenOpenAlexFDO

Authors Mike Hamburg

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-47989-6_34

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Point compression and coordinate recovery for Edwards curves over finite field
• Twisted Edwards Curves
• Faster Addition and Doubling on Elliptic Curves
• Compression for trace zero points on twisted Edwards curves
• Inverted Edwards Coordinates

Cites work

• A normal form for elliptic curves
• An efficient protocol for authenticated key agreement
• Circular-Secure Encryption from Decision Diffie-Hellman
• Efficient arithmetic on Hessian curves
• Efficient indifferentiable hashing into ordinary elliptic curves
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Faster Addition and Doubling on Elliptic Curves
• High-speed high-security signatures
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Twisted Edwards Curves
• Twisted Edwards Curves Revisited

Cited in

(16)

• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography
• The complete cost of cofactor \(h=1\)
• Speeding up regular elliptic curve scalar multiplication without precomputation
• The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
• Compression for trace zero points on twisted Edwards curves
• Point compression and coordinate recovery for Edwards curves over finite field
• On indifferentiable hashing into the Jacobian of hyperelliptic curves of genus 2
• Security Analysis of CPace
• A survey of elliptic curves for proof systems
• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
• Provably unforgeable threshold EdDSA with an offline participant and trustless setup
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Fast and simple point operations on Edwards448 and E448
• A prime-order group with complete formulas from even-order elliptic curves
• Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing

Describes a project that uses

Uses Software

• HMQV

This page was built for publication: Decaf: eliminating cofactors through point compression

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