Decaf: Eliminating Cofactors Through Point Compression
From MaRDI portal
Publication:3457135
DOI10.1007/978-3-662-47989-6_34zbMath1375.94133OpenAlexW2285532026MaRDI QIDQ3457135
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
Related Items (11)
Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography ⋮ The complete cost of cofactor \(h=1\) ⋮ 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 ⋮ The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728 ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2 ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup
Uses Software
Cites Work
- An efficient protocol for authenticated key agreement
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- High-Speed High-Security Signatures
- Twisted Edwards Curves
- Efficient Arithmetic on Hessian Curves
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- Circular-Secure Encryption from Decision Diffie-Hellman
- Twisted Edwards Curves Revisited
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols
This page was built for publication: Decaf: Eliminating Cofactors Through Point Compression
