On the Efficiency of A General Attack against the MOBS Cryptosystem

Christopher Battarbee; Delaram Kahrobaei; Dylan Tailor; Siamak F. Shahandashti

doi:10.1515/jmc-2021-0050

On the Efficiency of A General Attack against the MOBS Cryptosystem

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

Computer Science

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	289-297
Number of pages	9
Journal	Journal of Mathematical Cryptology
Volume	16
Issue number	1
DOIs	https://doi.org/10.1515/jmc-2021-0050
Publication status	Published - 23 Nov 2022

Bibliographical note

Keywords

cryptanalysis
computational cryptanalysis
key exchange
semidirect key exchange
Diffie-Hellman
MOBS
Matrices over Bitstrings

Access to Document

10.1515/jmc-2021-0050Licence: CC BY

On the efficiency of a general attack against the MOBS cryptosystem
© 2022 Christopher Battarbee et al.
Final published version, 2.17 MBLicence: CC BY

https://arxiv.org/pdf/2111.05806.pdf

Cite this

@article{83dd9058049348e79d3adeeedf8f520b,

title = "On the Efficiency of A General Attack against the MOBS Cryptosystem",

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 {\textquoteleft}MOBS (Matrices Over Bitstrings){\textquoteright} is an example of a scheme where the telescoping equality has too many solutions to be a practically viable means to conduct an attack.",

keywords = "cryptanalysis, computational cryptanalysis, key exchange, semidirect key exchange, Diffie-Hellman, MOBS, Matrices over Bitstrings",

author = "Christopher Battarbee and Delaram Kahrobaei and Dylan Tailor and Shahandashti, {Siamak F.}",

note = "{\textcopyright} 2022 Christopher Battarbee et al.",

year = "2022",

month = nov,

day = "23",

doi = "10.1515/jmc-2021-0050",

language = "English",

volume = "16",

pages = "289--297",

journal = "Journal of Mathematical Cryptology",

issn = "1862-2984",

publisher = "De Gruyter",

number = "1",

}

TY - JOUR

T1 - On the Efficiency of A General Attack against the MOBS Cryptosystem

AU - Battarbee, Christopher

AU - Kahrobaei, Delaram

AU - Tailor, Dylan

AU - Shahandashti, Siamak F.

PY - 2022/11/23

Y1 - 2022/11/23

N2 - 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.

AB - 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.

KW - cryptanalysis

KW - computational cryptanalysis

KW - key exchange

KW - semidirect key exchange

KW - Diffie-Hellman

KW - MOBS

KW - Matrices over Bitstrings

U2 - 10.1515/jmc-2021-0050

DO - 10.1515/jmc-2021-0050

M3 - Article

SN - 1862-2984

VL - 16

SP - 289

EP - 297

JO - Journal of Mathematical Cryptology

JF - Journal of Mathematical Cryptology

IS - 1

ER -