Author:
Reijnders Krijn,Samardjiska Simona,Trimoska Monika
Abstract
AbstractIn this paper, we analyze the hardness of the Matrix Code Equivalence () problem for matrix codes endowed with the rank metric, and provide the first algorithms for solving it. We do this by making a connection to another well-known equivalence problem from multivariate cryptography—the Isomorphism of Polynomials (). Under mild assumptions, we give tight reductions from to the homogenous version of the Quadratic Maps Linear Equivalence () problem, and vice versa. Furthermore, we present reductions to and from similar problems in the sum-rank metric, showing that is at the core of code equivalence problems. On the practical side, using birthday techniques known for , we present two algorithms: a probabilistic algorithm for running in time $$q^{\frac{2}{3}(n+m)}$$
q
2
3
(
n
+
m
)
up to a polynomial factor, and a deterministic algorithm for with roots, running in time $$q^{\min \{m,n,k\}}$$
q
min
{
m
,
n
,
k
}
up to a polynomial factor. Lastly, to confirm these findings, we solve randomly-generated instances of using these two algorithms.
Publisher
Springer Science and Business Media LLC
Reference52 articles.
1. Alfarano G.N., Lobillo F.J., Neri A., Wachter-Zeh A.: Sum-rank product codes and bounds on the minimum distance. Finite Fields Appl. 80, 102013 (2022).
2. Aragon N., Blazy O., Deneuville J.-C., Gaborit P., Hauteville A., Ruatta O., Tillich J.-P., Zemor G., Melchor C.A., Bettaieb S., Bidoux L., Bardet M., Otmani A.: ROLLO (Rank-Ouroboros, LAKE and LOCKER) (2019). https://csrc.nist.gov/projects/post-quantum-cryptography/round-2-submissions.
3. Aragon N., Gaborit P., Hauteville A., Ruatta O., Zémor G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inf. Theory 65, 7697–7717 (2019).
4. Barenghi A., Biasse J.-F., Persichetti E., Santini P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20–22, 2021, Proceedings 12, pp. 23–43. Springer (2021).
5. Barenghi A., Biasse J.-F., Persichetti E., Santini P.: On the computational hardness of the code equivalence problem in cryptography. Cryptology ePrint Archive, Paper 2022/967. https://eprint.iacr.org/2022/967 (2022).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献