Security Analysis of Asymmetric Cipher Protocol Based on Matrix Decomposition Problem

The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is based on matrix decomposition problem (MDP), which is linked to the problem of solution of multivariate polynomial system of equations. Compromitation of proposed scheme relies on the solution of system of multivariate polynomial system of equations over the semiring of natural numbers N. The security parameters are defined, security analysis and implementation is presented.

• Type: Journal
• Year: 2010
• Where: INFORMATICALT
• Authors: Andrius Raulynaitis, Eligijus Sakalauskas, Saulius Japertas
• Keywords: Cipher Protocol, Decomposition Problem, INFORMATICALT 2010, Multivariate Polynomial