Cryptanalysis of two schemes of Baba et al. by linear algebra methods
This work addresses security vulnerabilities in specific cryptosystems for cryptographic researchers, but it is incremental as it applies known attack methods to new schemes.
The authors tackled the problem of breaking two cryptographic schemes proposed by Baba et al. by applying linear algebra methods, resulting in successful attacks that recover the transmitted message and exchanged key.
We show that the attacks based on the linear decomposition method introduced by the author and the span-method introduced by Tsaban allow one to find the transmitted message in the cryptosystem and the exchanged key in the protocol which are proposed by Baba et al.