On the tropical discrete logarithm problem and security of a protocol based on tropical semidirect product
Authors:
- 20 September 2021
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (2) , 861-879
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 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.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Generalizations of bounds on the index of convergence to weighted digraphsDiscrete Applied Mathematics, 2014
- Weak CSR expansions and transience bounds in max-plus algebraLinear Algebra and its Applications, 2014
- Tropical CryptographyCommunications in Algebra, 2014
- Two cores of a nonnegative matrixLinear Algebra and its Applications, 2013
- CSR expansions of matrix powers in max algebraTransactions of the American Mathematical Society, 2012
- Max-linear Systems: Theory and Algorithms2010
- Max-algebra: the linear algebra of combinatorics?Linear Algebra and its Applications, 2003
- An efficient algorithm for critical circuits and finite eigenvectors in the max-plus algebraLinear Algebra and its Applications, 1999
- Powers of matrices over an extremal algebra with applications to periodic graphsMathematical Methods of Operations Research, 1997
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturingIEEE Transactions on Automatic Control, 1985