This work ​​​​​​​investigates how to use special matrices in the encryption and decryption of messages. The key matrix is used to encrypt the messages, and its inverse is used to decrypt the encoded messages. The key matrices must be kept secret between the message senders and the intended recipients. If the key matrix or its inverse is discovered, then all intercepted messages can be easily decoded.

special matrices, encryption, decryption, public and private keys.

Received: March 2, 2022; Revised: April 8, 2022; Accepted: April 11, 2022; Published: April 15, 2022

How to cite this article: Hakim Habri, Abdelhakim Chillali and Abdelkarim Boua, Key matrices in fully homomorphic encryption, JP Journal of Algebra, Number Theory and Applications 54 (2022), 35-50. http://dx.doi.org/10.17654/0972555522014

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License 

References:

[1] A. Boulbot, A. Chillali and A. Mouhib, Cryptographic protocols on the non-commutative ring R, International Journal of Mathematical and Computational Methods 2 (2017), 138-141.
[2] M. Elhassani, A. Chillali and A. Mouhib, A heuristic method to approximate the closest vector problem, WSEAS Transactions on Mathematics 20 (2021), 745-755.
[3] M. Elhassani, A. Boulbot, A. Chillali and A. Mouhib, Fully homomorphic encryption scheme on a non commutative ring R, International Conference on Intelligent Systems and Advanced Computing Sciences, ISACS, 2019.
[4] C. Gentry, A fully homomorphic encryption scheme, PhD thesis, Stanford University, 2009.
[5] P. Gille and T. Szamuely, Central simple algebras and Galois cohomology, Cambridge Studies in Mathematics 101, 2006.
[6] R. L. Rivest, L. Adleman and M. L. Dertouzos, On data banks and privacy homomorphisms, Massachusetts Institute of Technology Cambridge, Massachusetts, 1978, pp. 160-179.
[7] M. Zeriouh, A. Chillali and A. Boua, Cryptography based on the matrices, Bol. Soc. Parana. Mat. (3) 37(3) (2019), 75-83.