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难问题。