MOBS (Matrices Over Bit Strings) public key exchange
Rahman, Nael, Vladimir Shpilrain · arXiv (Cornell University) · 2021
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.