Paper 2021/1494

On the efficiency of a general attack against the MOBS cryptosystem

Christopher Battarbee, Delaram Kahrobaei, Dylan Tailor, and Siamak F. Shahandashti

Abstract

All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called ``telescoping equality''; in some cases, this equality has been used to construct an attack. In this report we present computational evidence suggesting that an instance of the scheme called `MOBS (Matrices Over Bitstrings)' is an example of a scheme where the telescoping equality has too many solutions to be a practically viable means to conduct an attack.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
key-exchangesemidirect productBoolean matrices
Contact author(s)
cb2036 @ york ac uk
History
2021-11-15: received
Short URL
https://ia.cr/2021/1494
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/1494,
      author = {Christopher Battarbee and Delaram Kahrobaei and Dylan Tailor and Siamak F.  Shahandashti},
      title = {On the efficiency of a general attack against the {MOBS} cryptosystem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1494},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1494}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.