Premium
A concurrent key exchange protocol based on commuting matrices
Author(s) -
Almulla M.,
Kanso A.,
Ghebleh M.
Publication year - 2011
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1802
Subject(s) - key exchange , computer science , symmetric key algorithm , key (lock) , protocol (science) , cipher , public key cryptography , scheme (mathematics) , cryptographic protocol , cryptography , theoretical computer science , computer network , computer security , mathematics , encryption , medicine , mathematical analysis , alternative medicine , pathology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom