Hadamard Matrix on Cryptographic Problems
- 10.2991/apr.k.220503.012How to use a DOI?
- Hadamard matrix; encryption; decryption; Hill Chiper
The application of matrices to cryptographic problems, especially with Hill Chiper algorithm, needs an invertible matrix as a key and a plaintext’s difuser. One of the invertible matrices is a Hadamard matrix (H). The Hadamard matrix is applied to cryptographic problems with Hill Chiper algorithm by modifying encryption and decryption processes with the help of Hadamard matrix properties and modulo operation. The Hill Chiper algorithm requires two keys, namely public and private keys. By using the Hadamard matrix as a public key, the encryption process can be shortened by eliminating the process of checking of the reverse key matrix. Any character can also be used as a private key provided the number of characters doesn’t exceed the square of the Hadamard matrix order.
- © 2022 The Authors. Published by Atlantis Press International B.V.
- Open Access
- This is an open access article distributed under the CC BY-NC 4.0 license.
Cite this article
TY - CONF AU - Salman Al Farizi AU - Mashuri Mashuri AU - Bambang Hendriya Guswanto PY - 2022 DA - 2022/05/25 TI - Hadamard Matrix on Cryptographic Problems BT - Proceedings of the Soedirman International Conference on Mathematics and Applied Sciences (SICOMAS 2021) PB - Atlantis Press SP - 54 EP - 58 SN - 2352-541X UR - https://doi.org/10.2991/apr.k.220503.012 DO - 10.2991/apr.k.220503.012 ID - AlFarizi2022 ER -