1,017 research outputs found
SPHINCS post-quantum digital signature scheme with Streebog hash function
Many commonly used public key cryptosystems will become insecure once a
scalable quantum computer is built. New cryptographic schemes that can
guarantee protection against attacks with quantum computers, so-called
post-quantum algorithms, have emerged in recent decades. One of the most
promising candidates for a post-quantum signature scheme is SPHINCS, which
is based on cryptographic hash functions. In this contribution, we analyze the
use of the new Russian standardized hash function, known as Streebog, for the
implementation of the SPHINCS signature scheme. We provide a performance
comparison with SHA-256-based instantiation and give benchmarks for various
sets of parameters.Comment: 5 pages, 2 figures, 3 table
An Improved Differential Attack on Full GOST
GOST 28147-89 is a well-known block cipher. Its large key size of 256 bits and incredibly low implementation cost make it a plausible alternative for AES-256 and triple DES. Until 2010 \despite considerable cryptanalytic efforts spent in the past 20 years", GOST was not broken see [30]. Accordingly, in 2010 GOST was submitted to ISO 18033 to become a worldwide industrial encryption standard. In paper we focus on the question of how far one can go in a dedicated Depth-First-Search approach with several stages of progressive guessing and filtering with successive distinguishers. We want to design and optimized guess-then-truncated differential attack on full 32-bit GOST and make as as efficient as we can. The main result of this paper is a single key attack against full 32-round 256-bit GOST with time complexity of 2^179 which is substantially faster than any other known single key attack on GOS
On multiple symmetric fixed points in GOST
In this article the author revisits the oldest attack on GOST known, the Kara Reflection attack, and another totally unrelated truncated differential attack by Courtois and Misztal. It is hard to imagine that there could be any relationship between two so remote attacks which have nothing in common. However, there is one: Very surprisingly, both properties can be combined and lead the fastest attack on GOST ever found, which is nearly feasible to execute in practice
Recommended from our members
Advanced truncated differential cryptanalysis of GOST block cipher
n this paper, we use the ideas presented by Courtois and Mourouzis to study the security of two variants of GOST, which are considered as the simpler and most secure variants [9]; the one with the S-boxes replaced by the Identity Map and the ISO version which is assumed to be the strongest one. The advanced differential attacks we present are of the form of Depth-First Key search, which uses a 20 round distinguisher in the middle (or equivalently 26-round distinguisher for the simpler version of GOST with Identity Map) [11]. The main idea is that we consider a partition of the 32 rounds by placing in the middle the constructed distinguisher. Then, based on the weak diffusion we can extend these very strong statistical distinguishers to efficiently good filters for some external rounds. Then, by guessing some key bits for external rounds and determining some plaintext and ciphertext pairs of specified input-output differences we can extend the construction to an attack against the full block cipher. Thus, the technique we apply is a generic cryptanalytic framework of First-Search key search type which involves several optimization tasks obtained from the specific structure of the given encryption algorithm
Hypothesis testing and advanced distinguishers in differential cryptanalysis of block ciphers
Distinguishing distributions is a major part during cryptanalysis of symmetric block ciphers. The goal of the cryptanalyst is to distinguish two distributions; one that characterizes the number of certain events which occur totally at random and another one that characterizes same type of events but due to propagation inside the cipher. This can be realized as a hypothesis testing problem, where a source is used to generate independent random samples in some given finite set with some distribution P, which is either R or W, corresponding to propagation inside the cipher or a random permutation respectively. Distinguisher’s goal is to determine which one is most likely the one which was used to generate the sample. In this paper, we study a general hypothesis-testing based approach to construct statistical distinguishers using truncated differential properties. The observable variable in our case is the expected number of pairs that follow a certain truncated differential property of the form ΔX → ΔY after a certain number of rounds. As a proof of concept, we apply this methodology to GOST and SIMON 64/128 block ciphers and present distinguishers on 20 and 22 rounds respectivel
Systematic Construction of Nonlinear Product Attacks on Block Ciphers
A major open problem in block cipher cryptanalysis is discovery of new invariant properties of complex type. Recent papers show that this can be achieved for SCREAM, Midori64, MANTIS-4, T-310 or for DES with modified S-boxes. Until now such attacks are hard to find and seem to happen by some sort of incredible coincidence. In this paper we abstract the attack from any particular block cipher. We study these attacks in terms of transformations on multivariate polynomials. We shall demonstrate how numerous variables including key variables may sometimes be eliminated and at the end two very complex Boolean polynomials will become equal. We present a general construction of an attack where multiply all the polynomials lying on one or several cycles. Then under suitable conditions the non-linear functions involved will be eliminated totally. We obtain a periodic invariant property holding for any number of rounds. A major difficulty with invariant attacks is that they typically work only for some keys. In T-310 our attack works for any key and also in spite of the presence of round constants
Can a Differential Attack Work for an Arbitrarily Large Number of Rounds?
Differential cryptanalysis is one of the oldest attacks on block ciphers. Can anything new be discovered on this topic? A related question is that of backdoors and hidden properties. There is substantial amount of research on how Boolean functions affect the security of ciphers, and comparatively, little research, on how block cipher wiring can be very special or abnormal. In this article we show a strong type of anomaly: where the complexity of a differential attack does not grow exponentially as the number of rounds increases. It will grow initially, and later will be lower bounded by a constant. At the end of the day the vulnerability is an ordinary single differential attack on the full state. It occurs due to the existence of a hidden polynomial invariant. We conjecture that this type of anomaly is not easily detectable if the attacker has limited resources
Image Steganography Analysis Using GOST Algorithm and PRNG Based on LSB
Security in communication is very important for everyone to pay attention to. To prevent data leakage and illegal retrieval of data, cryptography and steganography can be used. In this study, GOST and XOR LSB with PRNG were used to inject text into images. The final result shows that the combination of these two methods is quite good in terms of image quality, message capacity, embedding speed, and imperceptibility (cannot be seen with the naked eye). Of the 9 image formats tested, 7 images containing messages could be extracted properly with a median MSE of 0.0001935 and a median of PSNR of 85.261. Then, in terms of rotation, all im-age rotations from 90°, 180°, and 270° fail to extract messages and in terms of resizing all sizes from 10%, 30%, 50%, and 80% also fail to extract messages. The average time required for encryption with test data 6 test data is 0.073 seconds with the GOST algorithm, using GOST + XOR LSB with PNRG is 0.485 seconds. By using the XOR combination method LSB with PRNG can store an average of 43.3 bits. From the impercibility test using 5 respondents and visualization using an RGB histogram, it can be seen that there is no difference be-tween the cover image and the stego image
- …