Security Analysis of Asymmetric Cipher Protocol Based on Matrix Decomposition Problem

Authors:
Andrius Raulynaitis;Eligijus Sakalauskas;Saulius Japertas
Affiliations:
Kaunas University of Technology, Institute of Defense Technologies, Department of Applied Mathematics, Department of Telecommunications, Studentų 50, LT-51368 Kaunas, Lithuania, e-mail: andr ...;Kaunas University of Technology, Institute of Defense Technologies, Department of Applied Mathematics, Department of Telecommunications, Studentų 50, LT-51368 Kaunas, Lithuania, e-mail: andr ...;Kaunas University of Technology, Institute of Defense Technologies, Department of Applied Mathematics, Department of Telecommunications, Studentų 50, LT-51368 Kaunas, Lithuania, e-mail: andr ...
Venue:
Informatica
Year:
2010

Citing 9
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level

Informatica
A Pairing-Based User Authentication Scheme for Wireless Clients with Smart Cards

Informatica
Robust Key Exchange Protocol between Set-Top Box and Smart Card in DTV Broadcasting

Informatica
Efficient algorithms for solving overdefined systems of multivariate polynomial equations

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Identity-Based Threshold Proxy Signature from Bilinear Pairings

Informatica
An analysis of the XSL algorithm

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

The asymmetric cipher protocol, based on decomposition problem in matrix semiring ℳ over semiring of natural numbers 𝒩 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 𝒩. The security parameters are defined, security analysis and implementation is presented.