A key exchange protocol based on Diophantine equations and S-integers

Abstract

The aim of this article is to present a cryptosystem with a new key exchange protocol based on Diophantine equations of polynomial type. Our protocol is inspired by that of H. Yosh whose security comes from a translation of Diophantine equations. We suggest here a key exchange protocol relying on the hardness of solving Diophantine equations in the ring of $S$-integers.