Controlled elements for designing ciphers suitable to efficient VLSI implementation

This work considers the problem of increasing the performance of the ciphers based on Data-Dependent (DD) operations (DDO) for VLSI implementations. New minimum size primitives are proposed to design DDOs. Using advanced DDOs instead of DD permutations (DDP) in the DDP-based iterative ciphers Cobra-H64 and Cobra-H128 the number of rounds has been significantly reduced yielding enhancement of the “performance per cost” value and retaining security at the level of indistinguishability from a random transformation. To obtain further enhancement of this parameter a new crypto-scheme based on the advanced DDOs is proposed. The FPGA implementation of the proposed crypto-scheme achieves higher throughput value and minimizes the allocated resources than the conventional designs. Design of the DDO boxes of different orders is considered and their ASIC implementation is estimated.     

Information authentication in automated control systems based on finite groups with multidimensional cyclicity

The paper deals with information authentication for real time automatic control systems. Our approach differs from known ones in using finite groups of vectors over a finite field. We show that these groups of vectors are multidimensionally cyclic. This allows developing secure digital signature algorithms based on groups with the maximal prime factor of length 160/m bits where m is the vectors’ dimension. We list formulas describing this multidimensional cyclicity of vector groups.     

Controlled Operation-Based Fast Methods of Data Protection in Automated Control Systems

A new controlled operation-based approach was proposed to construct fast algorithms of information processing to tackle efficiently the topical problems of information protection in high-performance automated control systems. Design criteria were discussed, and the algebraic and probabilistic characteristics of the controlled dyadic operations were studied. Consideration was given to the promising methods of encryption for wide application in the information-protection facilities of the automated control systems.     

New Representative Collective Signatures Based on the Discrete Logarithm Problem

The representative collective digital signature scheme allows the creation of a unique collective signature on document M that represents an entire signing community consisting of many individual signers and many different signing groups, each signing group is represented by a group leader. On document M, a collective signature can be created using the representative digital signature scheme that represents an entire community consisting of individual signers and signing groups, each of which is represented by a group leader. The characteristic of this type of letter is that it consists of three elements (U, E, S), one of which (U) is used to store the information of all the signers who participated in the formation of the collective signature on document M. While storing this information is necessary to identify the signer and resolve disputes later, it greatly increases the size of signatures. This is considered a limitation of the collective signature representing 3 elements. In this paper, we propose and build a new type of collective signature, a collective signature representing 2 elements (E, S). In this case, the signature has been reduced in size, but it contains all the information needed to identify the signer and resolve disputes if necessary. To construct the approved group signature scheme, which is the basic scheme for the proposed representative collective signature schemes, we use the discrete logarithm problem on the prime finite field. At the end of this paper, we present the security analysis of the AGDS scheme and a performance evaluation of the proposed collective signature schemes.     

A cipher based on data-dependent permutations

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. Received March 2000 and revised May 2001 Online publication 29 August 2001     

New algorithms and protocols for information authentication in automatic control systems

Consideration was given to new protocols for information authentication in the automatic control systems distinguished from the existing protocols for using the notion of collective public key calculated depending on the given subset of public keys. It was suggested to use special cases of rooting a simple modulo as a complicated computational problem underlying the cryptographic algorithms and protocols. New algorithms for digital signature, collective digital signature, and composition digital signature were founded on it. The proposed philosophy of collective digital signature was shown to be realizable on the basis of some existing digital signature algorithms. It enables one to develop protocols for simultaneous signing of contract or package of contracts by an arbitrary number of users.     

New Collective Signatures Based on the Elliptic Curve Discrete Logarithm Problem

There have been many digital signature schemes were developed based on the discrete logarithm problem on a finite field. In this study, we use the elliptic curve discrete logarithm problem to build new collective signature schemes. The cryptosystem on elliptic curve allows to generate digital signatures with the same level of security as other cryptosystems but with smaller keys. To extend practical applicability and enhance the security level of the group signature protocols, we propose two new types of collective digital signature schemes based on the discrete logarithm problem on the elliptic curve: i) the collective digital signature scheme shared by several signing groups and ii) the collective digital signature scheme shared by several signing groups and several individual signers. These two new types of collective signatures have combined the advantages of group digital signatures and collective digital signatures. These signatures have a fixed size and do not depend on the number of members participating in the creation of the final collective signature. One of the advantages of the proposed collective signature protocols is that they can be deployed on top of the available public key infrastructures.     

Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces

New algebraic structures differing from the existing ones in new kinds of operations over finite sets of m-dimensional vectors (m ≥ 2) with discrete components were developed to construct information authentication algorithms for the automatic control systems. The operation of vector multiplication including multiplication and summation of the coordinates of the multiplied vectors modulo simple number p was defined. Depending on the structure of module p, dimensionality m, and value of the “extension” coefficients defined in terms of the rules of multiplication of the base vectors, the vector spaces were shown to include high-order finite groups or be extended fields that can be efficiently used to construct effective algorithms of electronic digital signature.