On a key exchange protocol based on Diophantine equations

Noriko Hirata-Kohno, A. Pethő

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)17-21
Number of pages5
JournalInfocommunications Journal
Volume5
Issue number3
Publication statusPublished - Sep 1 2013

Fingerprint

Hardness

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

On a key exchange protocol based on Diophantine equations. / Hirata-Kohno, Noriko; Pethő, A.

In: Infocommunications Journal, Vol. 5, No. 3, 01.09.2013, p. 17-21.

Research output: Contribution to journalArticle

@article{537ad7edb4394476856e0149fbae4d55,
title = "On a key exchange protocol based on Diophantine equations",
abstract = "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.",
author = "Noriko Hirata-Kohno and A. Pethő",
year = "2013",
month = "9",
day = "1",
language = "English",
volume = "5",
pages = "17--21",
journal = "Infocommunications Journal",
issn = "2061-2079",
publisher = "Scientific Association for Infocommunications",
number = "3",

}

TY - JOUR

T1 - On a key exchange protocol based on Diophantine equations

AU - Hirata-Kohno, Noriko

AU - Pethő, A.

PY - 2013/9/1

Y1 - 2013/9/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84938077845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938077845&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 17

EP - 21

JO - Infocommunications Journal

JF - Infocommunications Journal

SN - 2061-2079

IS - 3

ER -