On the efficiency of a general attack against the MOBS cryptosystem

From MaRDI portal
Publication:2680378

DOI10.1515/JMC-2021-0050zbMATH Open1505.94068arXiv2111.05806OpenAlexW3213515719MaRDI QIDQ2680378FDOQ2680378


Authors: Christopher Battarbee, Delaram Kahrobaei, Dylan Tailor, Siamak F. Shahandashti Edit this on Wikidata


Publication date: 30 December 2022

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

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' is an example of a scheme where the telescoping equality has too many solutions to be a practically viable means to conduct an attack.


Full work available at URL: https://arxiv.org/abs/2111.05806




Recommendations




Cites Work


Cited In (2)





This page was built for publication: On the efficiency of a general attack against the MOBS cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680378)