MOBS (Matrices Over Bit Strings) public key exchange
This work addresses the need for secure and efficient key exchange in cryptography, presenting a novel approach that could impact cryptographic systems.
The paper tackles the problem of designing efficient and secure public key exchange protocols by introducing MOBS, which uses matrices over bit strings with Boolean operations, resulting in high computational efficiency and resistance to standard attacks.
We use matrices over bit strings as platforms for Diffie-Hellman-like public key exchange protocols. When multiplying matrices like that, we use Boolean OR operation on bit strings in place of addition and Boolean AND operation in place of multiplication. As a result, (1) computations with these matrices are very efficient; (2) standard methods of attacking Diffie-Hellman-like protocols are not applicable.