A Modified Playfair Algorithm With International Nibbles

This research actually focused on reducing the size of the matrix that can be used to encrypt Unicode characters using a playfair algorithm. The previous work that attempted to encrpyt unicode characters using a playfair algorithm used a 256x256 matrix which is the normal size of matrix needed to encrypt unicode characters using a playfair algorithm. This research was able to reduce the size of the matrix to a 16x16. The reduction in the size of the matrix actually reduced the space that is needed for the matrix generation. As a result, it reduces the computation time by a sizable factor. In order to ensure that the security of cipher is not breached, the matrix is shuffled after encrypting each character.

Autorentext

The author hails from Zango Kataf Local Government Area of Kaduna State, Nigeria. He obtained his first and second degree in Computer Science from Ahmadu Bello University, Zaria, Nigeria. He currently teaches Computer Studies in Nigeria. His research interest is the field of cyber security