Pages that link to "Item:Q5048961"
From MaRDI portal
The following pages link to LESS is More: Code-Based Signatures Without Syndromes (Q5048961):
Displaying 16 items.
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- LESS-FM: fine-tuning signatures from the code equivalence problem (Q2118522) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- An attack on a non-interactive key exchange from code equivalence (Q2685412) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- On the computational hardness of the code equivalence problem in cryptography (Q6112221) (← links)
- Hardness estimates of the code equivalence problem in the rank metric (Q6130620) (← links)
- A code-based hybrid signcryption scheme (Q6175435) (← links)
- Building MPCitH-based signatures from MQ, MinRank, and rank SD (Q6547988) (← links)
- Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
- Code-based secret handshake scheme, revisited (Q6550613) (← links)
- A new formulation of the linear equivalence problem and shorter less signatures (Q6595929) (← links)
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head (Q6635752) (← links)
- Cutting the GRASS: threshold group action signature schemes (Q6636123) (← links)
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)