Journal:Informatica
Volume 21, Issue 2 (2010), pp. 215–228
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.
Journal:Informatica
Volume 15, Issue 2 (2004), pp. 251–270
Abstract
A new digital signature scheme in non‐commutative Gaussian monoid is presented. Two algebraic structures are employed: Gaussian monoid and a certain module being compatible with a monoid. For both monoid and module, presentation and action level attributes are defined. Monoid action level is defined as monoid element (word) action on module element as an operator. A module is a set of functions (elements) with special properties and could be treated as some generalization of vector space.
Signature scheme is based on the one‐way functions (OWF) design using: three recognized hard problems in monoid presentation level, one postulated hard problem in monoid action level and one provable hard problem in module action level.
For signature creation and verification the word equivalence problem is solved in monoid action level thus avoiding solving it in monoid presentation level. Then the three recognized hard problems in monoid presentation level can be essentially as hard as possible to increase signature security. Thus they do not influence on the word problem complexity and, consequently, on the complexity of signature realization.
The investigation of signature scheme security against four kind of attacks is presented. It is shown that the signature has a provable security property with respect to the list of attacks presented here, which are postulated to be complete.