We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
We analyse the security of new hash functions whose compression function is explicitly defined as a sequence of multivariate equations. First we prove non-universality of certain ...
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 ba...
Andrius Raulynaitis, Eligijus Sakalauskas, Saulius...
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...