SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
From MaRDI portal
Recommendations
- Cutting the GRASS: threshold group action signature schemes
- A practical group signature scheme based on rank metric
- G-Merkle: a hash-based group signature scheme from standard assumptions
- Digital signature scheme set in a hidden cyclic group
- A practical digital signature scheme based on the hidden logarithm problem
Cites work
- A linear decomposition attack
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Constructing elliptic curve isogenies in quantum subexponential time
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Cryptanalysis of ``MAKE
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- DLP in semigroups: algorithms and lower bounds
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Full quantum equivalence of group action DLog and CDH, and more
- Group-based Cryptography in the Quantum Era
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- scientific article; zbMATH DE number 3391003 (Why is no real title available?)
- MAKE: a matrix action key exchange
- Public key cryptography based on semigroup actions
- Public key exchange using semidirect product of (semi)groups
- Quantum algorithms for algebraic problems
- SeaSign: compact isogeny signatures from class group actions
- The automorphism group of a nonsplit metacyclic \(p\)-group.
- The MOR cryptosystem and extra-special p-groups
- Using Semidirect Product of (Semi)groups in Public Key Cryptography
Cited in
(6)- Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
- Cutting the GRASS: threshold group action signature schemes
- On the semidirect discrete logarithm problem in finite groups
- A small serving of mash: (quantum) algorithms for SPDH-sign with small parameters
- A subexponential quantum algorithm for the semidirect discrete logarithm problem
- Oblivious pseudorandom functions in non-commutative groups
This page was built for publication: SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493384)