A concurrent key exchange protocol based on commuting matrices. (28th July 2011)

• Record Type: Journal Article
• Authors: Almulla, M.; Kanso, A.; Ghebleh, M.; Fouchal, Hacène; Notare, Mirela Sechi Moretti Annoni
• Is Part Of: Concurrency and computation. Volume 25:Number 5(2013:Apr.)
• Page Start: 743
• Page End: 751
• Publication Date: 2011-07-28
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.1802
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe1802-abs-0001"> <title>SUMMARY</title> <p id="cpe1802-para-0001">In this paper, we suggest a cryptographic protocol for symmetric key exchange based on a set of <italic>m</italic> commutative square singular matrices of dimension <italic>n</italic>×<italic>n</italic>. 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 &amp; Sons, Ltd.</p> </abstract>