Avoiding trusted setup in isogeny-based commitments
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1304185 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- An algorithm for computing modular forms on \(\Gamma_0(N)\)
- Coin flipping by telephone a protocol for solving impossible problems
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- Constructing supersingular elliptic curves
- Constructing supersingular elliptic curves with a given endomorphism ring
- Cryptographic hash functions from expander graphs
- Digital Signatures
- Elliptic curves. Number theory and cryptography
- Exploring SIDH-based signature parameters
- Multi-authority secret-ballot elections with linear work
- On a method for solving the equation \(\sum_{h=0}^{n}c_hx^{n-h}y^h=P\) in integers.
- On the quaternion -isogeny path problem
- Parallel collision search with cryptanalytic applications
- Quaternion algebras
- SIDH proof of knowledge
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Supersingular curves you can trust
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- The Arithmetic of Elliptic Curves
This page was built for publication: Avoiding trusted setup in isogeny-based commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933645)
