Cryptanalysis of two schemes of Baba et al. by linear algebra methods
V. Roman'kov

TL;DR
This paper demonstrates that linear algebra techniques can effectively break the cryptosystems proposed by Baba et al., revealing transmitted messages and exchanged keys.
Contribution
It applies linear algebra-based cryptanalysis methods to analyze and break the cryptosystems of Baba et al., highlighting vulnerabilities.
Findings
Linear decomposition method can recover messages.
Span-method can find exchanged keys.
Cryptosystems are vulnerable to these linear algebra attacks.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptographic Implementations and Security · graph theory and CDMA systems
