Open AccessHill Cipher Cryptosystem over Complex Numbers
Author(s) -
Maxrizal Maxrizal
Publication year - 2019
Publication title -
indonesian journal of mathematics education
Language(s) - English
Resource type - Journals
eISSN - 2654-346X
pISSN - 2654-3907
DOI - 10.31002/ijome.v2i1.1217
Subject(s) - cryptosystem , plaintext , cipher , mathematics , key (lock) , ciphertext , goldwasser–micali cryptosystem , modulo , computer science , arithmetic , cryptography , theoretical computer science , discrete mathematics , encryption , hybrid cryptosystem , algorithm , computer security
The Hill Cipher cryptosystem is a symmetry key cryptosystem. This cryptosystem uses the concept of integer over modulo p. This cryptosystem uses a matrix K as a secret key. We must choose the key matrix K which has an inverse in modulo p. This secret key matrix will be used by the sender and recipient of the message to encrypt and descript the message. For this reason, this paper will discuss the generalization of Hill Cipher using matrices over complex numbers. Calculation of determinants and inverses of the matrix K will adopt a system of determinant and inverse calculations on Hill Cipher. The results show that the proposed cryptosystem scrambles the plaintext.