Pages that link to "Item:Q832357"
From MaRDI portal
The following pages link to Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357):
Displaying 8 items.
- An attack on a non-interactive key exchange from code equivalence (Q2685412) (← 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)
- Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
- PERK: compact signature scheme based on a new variant of the permuted kernel problem (Q6587197) (← links)
- A new formulation of the linear equivalence problem and shorter less signatures (Q6595929) (← links)
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
