We study several Russian key-agreement cryptographic protocols for compliance with specified security properties in view of possible adoption of these protocols as standardized solutions intended to be used in the Russian Federation. We have used a number of automatic cryptographic protocol verification tools available in the Internet such as Proverif, AVISPA-SPAN and Scyther, to simulate examined protocols. We find a number of vulnerabilities and propose ways to fix them.
In this article we present a new authenticated encryption mode for arbitrary block cipher. This mode is a combination of well known XEX (XorEncryption-Xor) mechanism used in XTS encryption mode and universal hash function with predetermined properties from special class of functions. The bit length of authentication code being twice as much as the length of a cipher block is an important feature of our mode. The other important feature is the possibility of parallel implementation. The description, some security considerations and aspects of practical implementation are supplied.
A timing attack against an AES-type block cipher CUDA implementa- tion is presented. Our experiments show that it is possible to extract a secret AES 128-bit key with complexity of 2^32 chosen plaintext encryptions. This approach may be applied to AES with other key sizes and, moreover, to any block cipher with a linear transform that is a composition of two types of linear transformations on a substate.
We present optimization guidelines and implementations of cryptographic hash functions GOST R 34.11-94 and GOST R 34.11-2012. Results for x86_64 CPUs and NVIDIA CUDA-capable GPUs are provided for our and several other well-known implementations. It is shown that the new standard may be twice as fast as the old one on modern CPUs, but it may be slower on embedded devices and GPUs. The results given for our implementation are the fastest among all the tested implementations on both platforms.
An algorithm for the construction of elliptic curves satisfying special requirements is presented. The choice of requirements aims to prevent known attacks on the elliptic curve discrete logarithm problem in special cases. The results of practical experiments are discussed, some parameters of concrete elliptic curves are given.
In this article we present an algorithm for constructing an elliptic curve endomorphism for given complex irrationality. This endomorphism can be used for speeding up a group operation on elliptic curve.
The project of the standard of neural network biometric containers protection using cryptographic algorithms is analysed. The inconsistency of the suggested combination of password and neural network biometric information protection systems is shown.
We present an approach to build an efficient implementation of the Russian national digital signature scheme GOST R 34.10 in view of the recently proposed extensions to the standard. We describe practical issues arising with the usage of modern algorithms for scalar multiplication together with various alternative representations of elliptic curves over prime finite fields under restrictions imposed by the standard. Finally, we present results of numerical experiments and propose recommendations on selection of parameters of described algorithms.
In this article we consider NVIDIA GPU implementation aspects of an XSL block cipher over the finite field with MDS-matrix linear transformation. We compare obtained results with some other block ciphers.
This work introduces new classes of 8-bit permutation based on a butterfly structure. These classes set up a new way for generating 2n-bit permutation from n-bit ones. We introduce some classes that contain permutations with good cryptographic properties and could be efficiently implemented for hardware and software applications.
We propose an algorithm for solving the discrete logarithm problem on the elliptic curve. This algorithm uses additional information on the multiplicative order of the solution and may be realised in parallel.
We propose several asymptotically size-optimal Boolean circuits synthesis methods that implement arbitrary Boolean functions of a given number of Boolean variables with a given protection level from functionality inference when concealing some number of local interconnections. These methods rely on the structure of Boolean circuits over arbitrary finite complete basis. Constructed by methods of generalized decomposition and universal systems of Boolean functions.
We study parameters of some permutations constructed by the «Butterfly» scheme. The influence of these parameters on the algebraic degree of permutation and its differential uniformity is investigated.
We consider a new approach to the representation of irrational numbers defined by rapidly convergent series in an arbitrary base. For two large classes of such numbers some algorithms of their representation are described; also the number of operations and the memory volume used are estimated. The possibility of efficient realization of these algorithms is studied.
In this paper we consider a bit-sliced implementation of the non-linear transformation shared by GOST R 34.12-2015 “Kuznyechik” block cipher and GOST R 34.11-2012 “Streebog” hash function. We combine analytical and computer methods to get a 226 Boolean operations representation.
We construct a new family of compressing mappings by means of superposition of several bijective mappings and mappings with specified properties. All functions in this family are proved to be universal hash functions. Concrete examples of functions from the family which are suitable for cryptographic applications are supplied.