Get access

A concurrent key exchange protocol based on commuting matrices

Authors


Correspondence to: M. Almulla, Computer Science Department, Faculty of Science, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait.

E-mail:almulla@sci.kuniv.edu.kw

SUMMARY

In this paper, we suggest a cryptographic protocol for symmetric key exchange based on a set of m commutative square singular matrices of dimension n×n. The suggested scheme provides a concurrent technique for users of symmetric-key cipher systems to securely exchange their private keys over public channels. This protocol is shown to possess a high level of security based on the algorithm's parameters. We also present a scheme for generating pseudorandom numbers from a single chaotic map for use in various applications, in particular, the suggested key exchange protocol.Copyright © 2011 John Wiley & Sons, Ltd.

Get access to the full text of this article

Ancillary