Document Type : Research Paper

Authors

• Sameerah Faris Khlebus
• Rajaa K. Hasoun
• Bassam Talib Sabri

College of Business Administration of Informatics, University of Information Technology and Communication, Baghdad, Iraq

Abstract

Cayley- Purser Algorithm is a public key algorithm invited by Sarah Flannery in 1998. The algorithm of Cayley-Purser is much faster than some public key methods like RSA but the problem of it is that it can be easily broken especially if some of the private key information is known. The solution to this problem is to modify this algorithm to be more secure than before so that it gives its utilizers the confidence of using it in encrypting important and sensitive information. In this paper, a modification to this algorithm based on using general linear groups over Galois field $GF(p^n)$, which is represented by $GL_m(GF(p^n))$ where $n$ and $m$ are positive integers and $p$ is prime, instead of $GL_2(Z_n)$ which is General linear set of inverted matrices $2 \times 2$ whose entries are integers modulo $n$. This $GL_m(GF(p^n))$ ensures that the secret key of this algorithm would be very hard to be obtained. Therefore, this new modification can make the Cayley-Purser Algorithm more immune to any future attacks.

Keywords

• Cryptography
• Cayley- Purser Algorithm
• Galois field $ GF(p^{n})$
• General Linear group over $ GF(p^{n})(GL_{m}(GF(p^{n}))$
• Encryption, Decryption