Pages that link to "Item:Q6112221"
From MaRDI portal
The following pages link to On the computational hardness of the code equivalence problem in cryptography (Q6112221):
Displaying 9 items.
- \textsf{FuLeeca}: a Lee-based signature scheme (Q6550578) (← links)
- Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
- Code-based secret handshake scheme, revisited (Q6550613) (← links)
- Monomial isomorphism for tensors and applications to code equivalence problems (Q6564091) (← links)
- Non-interactive commitment from non-transitive group actions (Q6595925) (← links)
- A new formulation of the linear equivalence problem and shorter less signatures (Q6595929) (← links)
- Representations of group actions and their applications in cryptography (Q6615541) (← links)
- Cutting the GRASS: threshold group action signature schemes (Q6636123) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
