We analyze a recent key exchange protocol proposed by H. Yosh, which is based on the hardness to solve Diophantine equations. In this article, we analyze the protocol and show that the public key is very large. We suggest large families of parameters both in the finite field and in the rational integer cases for which the protocol can be secure.
|Number of pages||5|
|Publication status||Published - Sep 1 2013|
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering