Paper 2025/208 Original: eprint.iacr.org/2025/208 ↗
Reductions Between Code Equivalence Problems
Abstract
In this paper we present two reductions between variants of the Code Equivalence problem. We give polynomial-time Karp reductions from Permutation Code Equivalence (PCE) to both Linear Code Equivalence (LCE) and Signed Permutation Code Equivalence (SPCE). Along with a Karp reduction from SPCE to the Lattice Isomorphism Problem (LIP) proved in a paper by Bennett and Win (2024), our second result implies a reduction from PCE to LIP.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2025-11-25: last updated
- 2025-02-11: published
- Short URL
- https://ia.cr/2025/208
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/208,
author = {Mahdi Cheraghchi and Nikhil Shagrithaya and Alexandra Veliche},
title = {Reductions Between Code Equivalence Problems},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/208},
year = {2025},
url = {https://eprint.iacr.org/2025/208}
}