Code-based cryptography is one of the main candidates for post-quantum cryptography. In fact, its security relies on the hardness of decoding a random-looking linear code, a problem believed to remain difficult even for quantum computers. In particular, rank-metric code-based cryptosystems have attracted significant interest due to their ability to achieve smaller key sizes compared to classical Hamming-metric constructions. Gabidulin codes, which are the rank-metric analogues of Reed–Solomon codes, play a central role among rank-metric codes thanks to their optimal error-correction capability. However, their strong algebraic structure makes them vulnerable to structural attacks, such as Overbeck’s attack, which can distinguish these codes from random ones and recover the hidden structure.