On the efficiency of a general attack against the MOBS cryptosystem

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

Full description

Bibliographic Details
Main Authors: Battarbee Christopher, Kahrobaei Delaram, Tailor Dylan, Shahandashti Siamak F.
Format: Article
Language:English
Published: De Gruyter 2022-11-01
Series:Journal of Mathematical Cryptology
Subjects:
Online Access:https://doi.org/10.1515/jmc-2021-0050
_version_ 1811214323017580544
author Battarbee Christopher
Kahrobaei Delaram
Tailor Dylan
Shahandashti Siamak F.
author_facet Battarbee Christopher
Kahrobaei Delaram
Tailor Dylan
Shahandashti Siamak F.
author_sort Battarbee Christopher
collection DOAJ
description 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.
first_indexed 2024-04-12T06:02:32Z
format Article
id doaj.art-3b3c2ce85e0d4dca8ae431d69840d08e
institution Directory Open Access Journal
issn 1862-2984
language English
last_indexed 2024-04-12T06:02:32Z
publishDate 2022-11-01
publisher De Gruyter
record_format Article
series Journal of Mathematical Cryptology
spelling doaj.art-3b3c2ce85e0d4dca8ae431d69840d08e2022-12-22T03:45:00ZengDe GruyterJournal of Mathematical Cryptology1862-29842022-11-0116128929710.1515/jmc-2021-0050On the efficiency of a general attack against the MOBS cryptosystemBattarbee Christopher0Kahrobaei Delaram1Tailor Dylan2Shahandashti Siamak F.3Department of Computer Science, University of York, Heslington, York YO10 5DD, UKDepartment of Computer Science, University of York, Heslington, York YO10 5DD, UKDepartment of Computer Science, University of York, Heslington, York YO10 5DD, UKDepartment of Computer Science, University of York, Heslington, York YO10 5DD, UKAll 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.https://doi.org/10.1515/jmc-2021-0050boolean matricespublic key exchangesemigroup theory16y6094a6020m12
spellingShingle Battarbee Christopher
Kahrobaei Delaram
Tailor Dylan
Shahandashti Siamak F.
On the efficiency of a general attack against the MOBS cryptosystem
Journal of Mathematical Cryptology
boolean matrices
public key exchange
semigroup theory
16y60
94a60
20m12
title On the efficiency of a general attack against the MOBS cryptosystem
title_full On the efficiency of a general attack against the MOBS cryptosystem
title_fullStr On the efficiency of a general attack against the MOBS cryptosystem
title_full_unstemmed On the efficiency of a general attack against the MOBS cryptosystem
title_short On the efficiency of a general attack against the MOBS cryptosystem
title_sort on the efficiency of a general attack against the mobs cryptosystem
topic boolean matrices
public key exchange
semigroup theory
16y60
94a60
20m12
url https://doi.org/10.1515/jmc-2021-0050
work_keys_str_mv AT battarbeechristopher ontheefficiencyofageneralattackagainstthemobscryptosystem
AT kahrobaeidelaram ontheefficiencyofageneralattackagainstthemobscryptosystem
AT tailordylan ontheefficiencyofageneralattackagainstthemobscryptosystem
AT shahandashtisiamakf ontheefficiencyofageneralattackagainstthemobscryptosystem