Open AccessModified Public Key Cryptosystem Based On Circulant Matrix
Author(s) -
Maxrizal Maxrizal,
I Gusti Nyoman Yudi Hartawan,
Padrul Jana,
Baiq Desy Aniska Prayanti
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1503/1/012007
Subject(s) - circulant matrix , cryptosystem , commutative property , polynomial , mathematics , public key cryptography , key (lock) , matrix (chemical analysis) , linearization , algebra over a field , discrete mathematics , encryption , computer science , cryptography , pure mathematics , algorithm , computer security , mathematical analysis , nonlinear system , quantum mechanics , materials science , physics , composite material
Experts believe that public key cryptosystems on non-commutative algebraic structures are resistant to the attack of quantum algorithms. In recent years, public key cryptosystems based on Polynomial Symmetrical Decomposition (PSD) on the non-commutative group have been developed. However, they are vulnerable to direct attack, linearization equations attack, and overdefined systems of multivariate polynomial equations attack. This cryptosystem has also been improved by experts. However, the operation of the proposed PSD Improvement still uses complex computing and untested. Therefore in this paper, we replace PSD on a non-commutative group into a non-commutative matrix group. We chose the circulant matrix on the key agreement protocol and the key distribution. The results show that the cryptosystem proposed on the circulant matrix is resistant to direct attack, linearization equations attack, and overdefined systems of multivariate polynomial equations attack.