MOBS (Matrices Over Bit Strings) public key exchange

TL;DR

This paper introduces a novel public key exchange protocol using matrices over bit strings with Boolean operations, offering efficient computations and resistance to traditional attacks.

Contribution

It proposes a new Diffie-Hellman-like protocol based on Boolean matrix operations, which are computationally efficient and secure against standard attacks.

Findings

Efficient matrix computations using Boolean operations.

Protocol resists standard Diffie-Hellman attacks.

Potential for practical cryptographic applications.

Abstract

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.