Title :
Fast asymmetric cryptosystem based on Boolean product of matrices
Author :
Alaverdyan, Yeghisabet ; Margarov, Gevorg
Author_Institution :
Inf. Tecnologies Dept., Eur. Regional Educ. Acad. in Armenia, Yerevan
Abstract :
Given premises for constructing a fast asymmetric algorithm based on Boolean product of matrices. Description of the encryption/decryption process based on Boolean product of matrices involving Boolean permutations and the structure of public and secret key pairs are proposed. The security of such asymmetric cryptosystem is based on the difficulty of matrices decomposition and large composite Boolean permutations inversion. A quantitative analysis of stability of public key cryptosystems based on Boolean product of matrices is given.
Keywords :
Boolean algebra; matrix decomposition; matrix multiplication; private key cryptography; public key cryptography; Boolean matrix product; Boolean permutation inversion; asymmetric cryptosystem; encryption/decryption process; matrix decomposition; public key pair; secret key pair; Arithmetic; Boolean functions; Information security; Logic; Matrix decomposition; Programming; Public key; Public key cryptography; Software algorithms; Stability analysis;
Conference_Titel :
Computer Systems and Applications, 2009. AICCSA 2009. IEEE/ACS International Conference on
Conference_Location :
Rabat
Print_ISBN :
978-1-4244-3807-5
Electronic_ISBN :
978-1-4244-3806-8
DOI :
10.1109/AICCSA.2009.5069354
