On the tropical discrete logarithm problem and security of a protocol based on tropical semidirect product

TL;DR

This paper introduces an algorithm for the tropical discrete logarithm problem and demonstrates its effectiveness in attacking a protocol based on tropical semidirect product, raising security concerns.

Contribution

It presents a novel algorithm for the tropical discrete logarithm problem and analyzes its implications for the security of related cryptographic protocols.

Findings

The algorithm efficiently solves the tropical discrete logarithm problem in certain cases.

The attack successfully compromises a protocol based on tropical semidirect product in specific scenarios.

Numerical experiments confirm the algorithm's practical efficiency.

Abstract

Tropical linear algebra has been recently put forward by Grigoriev and Shpilrain as a promising platform for implementation of protocols of Diffie-Hellman and Stickel type. Based on the CSR expansion of tropical matrix powers, we suggest a simple algorithm for the following tropical discrete logarithm problem: "Given that $A=V\otimes F^{\otimes t}$ for a unique $t$ and matrices $A$, $V$, $F$ of appropriate dimensions, find this $t$." We then use this algorithm to suggest a simple attack on a protocol based on the tropical semidirect product. The algorithm and the attack are guaranteed to work in some important special cases and are shown to be efficient in our numerical experiments.