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.

翻译：我们使用热带代数作为高效数字签名协议的底层数学结构。其安全性依赖于一元热带多项式因式分解的计算困难性——该问题已知为NP困难问题。