Sneaking up the ranks: Partial key exposure attacks on rank-based schemes

This work demonstrates that, similar to the RSA case, the secret key in RYDE can be recovered from a constant fraction of its bits, and shows a generic reduction from recovering RYDE and MIRA’s witness to the MinRank problem, which leads to efficient key recovery from constant fractions of the secret witness in both cases.