Take your MEDS: digital signatures from matrix code equivalence

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
CSIDH: an efficient post-quantum commutative group action
Quantum security analysis of CSIDH
Practical post-quantum signature schemes from isomorphism problems of trilinear forms
CSI-FiSh: efficient isogeny based signatures through class group computations
SeaSign: compact isogeny signatures from class group actions
Improvements of algebraic attacks for solving the rank decoding and MinRank problems
Cryptographic group actions and applications
Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
Cryptanalysis of MinRank
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Computing automorphism groups of error-correcting codes
Efficient generation of random nonsingular matrices
Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
LESS is More: Code-Based Signatures Without Syndromes
On the Lattice Isomorphism Problem
On lattices, learning with errors, random linear codes, and cryptography
The return of the SDitH
On the computational hardness of the code equivalence problem in cryptography

This page was built for publication: Take your MEDS: digital signatures from matrix code equivalence