Nikolay A. Moldovyan

Learn More
Data-dependent permutations (DDP) are introduced as basic cryptographic primitives to construct fast hardware-oriented ciphers. Some variants of the DDP operations and their application in the cipher CIKS-1 are considered. A feature of CIKS-1 is the use of both the data-dependent transformation of round subkeys and the key-dependent DDP operations.
This work focuses the problem of increasing the integral implementation efficacy of block ciphers. It proposes a new approach to the cipher design, suitable to applications, where constrained resources are available to embedded security mechanisms, such as ad-hoc, sensor and wireless networks. The paper develops the cipher design approach based on the use(More)
Using the digital signature (DS) scheme specified by Belarusian DS standard there are designed the collective and blind collective DS protocols. Signature formation is performed simultaneously by all of the assigned signers, therefore the proposed protocols can be used also as protocols for simultaneous signing a contract. The proposed blind collective DS(More)
Special form of finite fields (FFs), called vector FFs (VFFs), is defined in the vector spaces over the ground finite field GF (p) using particular types of the multiplication operation over vectors. Implementation of the cryptographic algorisms based on elliptic curves (ECs) over VFFs provides significantly higher performance than the implementation of the(More)
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed with so called controlled permutation boxes (CPB) which are fast while implemented in cheap hardware. The latter defines the efficiency of the embedding of CPB in microcontrollers(More)