The Matrix Subcode Equivalence problem and its application to signature with MPC-in-the-Head
This work introduces new hard problems, like Matrix Subcode Equivalence (MSE), to build a post-quantum signature scheme using MPC-in-the-Head techniques. The authors prove MSE reduces to the NP-Complete Hamming Subcode Equivalence problem, establishing a new foundation for constructing secure signatures based on these matrix code problems.