Identification protocols and signature schemes based on supersingular isogeny problems
From MaRDI portal
Publication:5919490
DOI10.1007/s00145-019-09316-0zbMath1455.94155OpenAlexW2769794532WikidataQ128093348 ScholiaQ128093348MaRDI QIDQ5919490
Christophe Petit, Steven D. Galbraith, Javier Silva
Publication date: 3 March 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-019-09316-0
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (17)
Orientations and the supersingular endomorphism ring problem ⋮ Séta: Supersingular Encryption from Torsion Attacks ⋮ Supersingular curves you can trust ⋮ Proving knowledge of isogenies: a survey ⋮ M-SIDH and MD-SIDH: countering SIDH attacks by masking information ⋮ Breaking SIDH in polynomial time ⋮ New algorithms for the Deuring correspondence. Towards practical and secure SQISign signatures ⋮ Orienteering with one endomorphism ⋮ Accelerating the Delfs-Galbraith algorithm with fast subfield root detection ⋮ SIDH proof of knowledge ⋮ Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures ⋮ Efficiency of SIDH-based signatures (yes, SIDH) ⋮ Oblivious pseudorandom functions from isogenies ⋮ Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman ⋮ Efficient post-quantum undeniable signature on 64-bit ARM ⋮ One-way functions and malleability oracles: hidden shift attacks on isogeny-based protocols ⋮ Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- Zero-knowledge proofs of identity
- Arithmétique des algèbres de quaternions
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Faster algorithms for isogeny problems using torsion point images
- La conjecture de Weil. I
- Computing Frobenius maps and factoring polynomials
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- On the quaternion -isogeny path problem
- Isogeny-Based Quantum-Resistant Undeniable Signatures
- A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- On the Security of Supersingular Isogeny Cryptosystems
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Fast Polynomial Factorization and Modular Composition
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Expander graphs and their applications
- Herding Hash Functions and the Nostradamus Attack
- Digital Signatures
- Hash function requirements for Schnorr signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Ramanujan graphs and Hecke operators
- Efficient distributed quantum computing
- Constructing elliptic curve isogenies in quantum subexponential time
- Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
- Abelian varieties over finite fields
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
This page was built for publication: Identification protocols and signature schemes based on supersingular isogeny problems
