MOBS (Matrices Over Bit Strings) public key exchange

Nael Rahman; Vladimir Shpilrain

Paper 2021/560 Original: eprint.iacr.org/2021/560 ↗

MOBS (Matrices Over Bit Strings) public key exchange

Nael Rahman

Vladimir Shpilrain

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2021-12-28: last updated; 2021-05-03: published
Short URL: https://ia.cr/2021/560
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/560,
      author = {Nael Rahman and Vladimir Shpilrain},
      title = {MOBS (Matrices Over Bit Strings) public key exchange},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/560},
      year = {2021},
      url = {https://eprint.iacr.org/2021/560}
}