Tropical cryptography III: digital signatures
Jiale Chen, Dima Grigoriev, Vladimir Shpilrain
TL;DR
This paper introduces a digital signature protocol based on tropical algebra, leveraging the NP-hardness of factoring tropical polynomials for security, aiming for high efficiency.
Contribution
It presents a novel digital signature scheme utilizing tropical algebra, with security grounded in the computational hardness of tropical polynomial factorization.
Findings
The proposed protocol is computationally efficient.
Security is based on NP-hard tropical polynomial factoring.
The scheme demonstrates practical viability.
Abstract
We use tropical algebras as platforms for a very efficient digital signature protocol. Security relies on computational hardness of factoring one-variable tropical polynomials; this problem is known to be NP-hard.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · Cryptographic Implementations and Security