Use of Hamiltonian Cycles in Cryptograph

Details Use of Hamiltonian Cycles in Cryptograph Use of Hamiltonian Cycles in Cryptograph

2011-07-15

arxiv.org/abs/1107.3172v1

Computer Science

Information Theory

Scientific paper

In cryptography, key distribution is always an important issue in establishing a symmetric key. The famous method of exchanging keys, Diffie-Hellman key exchange, is also vulnerable to a man-in-the-middle attack. Therefore, many protocols are proposed to secure the exchange such as the authenticated D-H key agreement protocol, station-to-station (STS) protocol and secure socket layer/transport layer security (SSL/TLS) protocol. With these protocols, we propose a novel protocol based on the Hamiltonian cycle problem which is NP-complete. The novel protocol can make key agreement in one step, moreover, make a intermediate useless to an adversary.

Affiliated with

Also associated with

No associations

Rating

Use of Hamiltonian Cycles in Cryptograph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Use of Hamiltonian Cycles in Cryptograph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Use of Hamiltonian Cycles in Cryptograph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549476