Misplaced Pages

Tropical cryptography

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Cryptography using tropical algebra
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Tropical cryptography" – news · newspapers · books · scholar · JSTOR (June 2018) (Learn how and when to remove this message)

In tropical analysis, tropical cryptography refers to the study of a class of cryptographic protocols built upon tropical algebras. In many cases, tropical cryptographic schemes have arisen from adapting classical (non-tropical) schemes to instead rely on tropical algebras. The case for the use of tropical algebras in cryptography rests on at least two key features of tropical mathematics: in the tropical world, there is no classical multiplication (a computationally expensive operation), and the problem of solving systems of tropical polynomial equations has been shown to be NP-hard.

Basic Definitions

The key mathematical object at the heart of tropical cryptography is the tropical semiring ( R { } , , ) {\displaystyle (\mathbb {R} \cup \{\infty \},\oplus ,\otimes )} (also known as the min-plus algebra), or a generalization thereof. The operations are defined as follows for x , y R { } {\displaystyle x,y\in \mathbb {R} \cup \{\infty \}} :

x y = min { x , y } {\displaystyle x\oplus y=\min\{x,y\}}
x y = x + y {\displaystyle x\otimes y=x+y}

It is easily verified that with {\displaystyle \infty } as the additive identity, these binary operations on R { } {\displaystyle \mathbb {R} \cup \{\infty \}} form a semiring.

References

  1. Grigoriev, Dima; Shpilrain, Vladimir (2014). "Tropical Cryptography". Communications in Algebra. 42 (6): 2624–2632. arXiv:1301.1195. doi:10.1080/00927872.2013.766827. ISSN 0092-7872. S2CID 6744219.
Categories: