Informatica

The article presents the tax declaration scheme using blockchain confidential transactions based on the modified ElGamal encryption providing additively-homomorphic property. Transactions are based on the unspent transactions output (UTxO) paradigm allowing to effectively represent digital asset of cryptocurrencies in e-wallets and to perform financial operations. The main actors around transaction are specified, include money senders, receivers, transaction creator, Audit Authority (AA) and Net of users. A general transaction model with M inputs and N outputs is created, providing transaction amount confidentiality and verifiability for all actors with different levels of available information.

Commonly modern symmetric encryption schemes (e.g. AES) use rather simple actions repeated many times by defining several rounds to calculate the ciphertext. An idea we previously offered was to trade these multiple repeats for one non-linear operation. Recently we proposed a perfectly secure symmetric encryption scheme based on the matrix power function (MPF). However, the platform group we used was commuting. In this paper, we use a non-commuting group whose cardinality is a power of 2 as a platform for MPF. Due to the convenient cardinality value, our scheme is more suitable for practical implementation. Moreover, due to the non-commuting nature of the platform group, some “natural” constraints on the power matrices arise. We think that this fact complicates the cryptanalysis of our proposal. We demonstrate that the newly defined symmetric cipher possesses are perfectly secure as they were previously done for the commuting platform group. Furthermore, we show that the same secret key can be used multiple times to encrypt several plaintexts without loss of security. Relying on the proven properties we construct the cipher block chaining mode of the initial cipher and show that it can withstand an adaptive chosen plaintext attack.

In our previous paper we presented an offline e-cash system with observers. We have shown that the proposed system satisfies basic requirements for e-cash schemes. We also covered such security issues as chosen message attack resistance and forgery of protocols data. However, in that paper we focused more on the system itself, rather than its analysis.

The vulnerable part of communications between user and server is the poor authentication level at the user’s side. For example, in e-banking systems for user authentication are used passwords that can be lost or swindled by a person maliciously impersonating bank.

In this paper we consider an improved version of earlier published asymmetric encryption protocol based on matrix power function (MPF). Recently, a linear algebra attack on earlier version of this protocol was found. This attack allows an attacker to break suggested protocol in polynomial time.

New asymmetric cipher based on matrix power function is presented. Cipher belongs to the class of recently intensively evolving non-commuting cryptography due to expectation of its resistance to potential quantum cryptanalysis.

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.

The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed.

A modernization of signature scheme published in (Sakalauskas, 2004) is presented. This scheme differs from the prototype by its structure and uses a more general algebraic systems. It has a higher security and shorter key length and is also more computationally effective.

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.