295 research outputs found
On Algebraic Relations of Serpent S-Boxes
Serpent is a 128-bit block cipher designed by Ross Anderson, Eli Biham and Lars Knudsen as a candidate for the Advanced Encryption Standard (AES). It was a finalist in the AES competition. The winner, Rijndael, got 86 votes at the last AES conference while Serpent got 59 votes [1]. The designers of Serpent claim that Serpent is more secure than Rijndael.In this paper we have observed that the nonlinear order of all output bits of serpent S-boxes are not 3 as it is claimed by the designers
Matrix Power S-box Analysis
* Work supported by the Lithuanian State Science and Studies Foundation.Construction of symmetric cipher S-box based on matrix power function and dependant on key is
analyzed. The matrix consisting of plain data bit strings is combined with three round key matrices using
arithmetical addition and exponent operations. The matrix power means the matrix powered by other matrix. This
operation is linked with two sound one-way functions: the discrete logarithm problem and decomposition problem.
The latter is used in the infinite non-commutative group based public key cryptosystems. The mathematical
description of proposed S-box in its nature possesses a good “confusion and diffusion” properties and contains
variables “of a complex type” as was formulated by Shannon. Core properties of matrix power operation are
formulated and proven. Some preliminary cryptographic characteristics of constructed S-box are calculated
Algebraic Techniques in Differential Cryptanalysis
Abstract. In this paper we propose a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques. More specifically, we show how to use algebraic relations arising from differential characteristics to speed up and improve key-recovery differential attacks against block ciphers. To illustrate the new technique, we apply algebraic techniques to mount differential attacks against round reduced variants of Present-128.
Matrix Power S-Box Construction
The new symmetric cipher S-box construction based on matrix power
function is presented. The matrix consisting of plain data bit
strings is combined with three round key matrices using arithmetical
addition and exponent operations. The matrix power means the matrix
powered by other matrix. The left and right side matrix powers are
introduced. This operation is linked with two sound one-way
functions: the discrete logarithm problem and decomposition problem.
The latter is used in the infinite non-commutative group based
public key cryptosystems. It is shown that generic S-box equations
are not transferable to the multivariate polynomial equations in
respect of input and key variables and hence the algebraic attack to
determine the key variables cannot be applied in this case. The
mathematical description of proposed S-box in its nature possesses a
good ``confusion and diffusion\u27\u27 properties and contains variables
``of a complex type\u27\u27 as was formulated by Shannon.
Some comparative simulation results are presented
C-DIFFERENTIALS AND GENERALIZED CRYPTOGRAPHIC PROPERTIES OF VECTORIAL BOOLEAN AND P-ARY FUNCTIONS
This dissertation investigates a newly defined cryptographic differential, called a c-differential, and its relevance to the nonlinear substitution boxes of modern symmetric block ciphers. We generalize the notions of perfect nonlinearity, bentness, and avalanche characteristics of vectorial Boolean and p-ary functions using the c-derivative and a new autocorrelation function, while capturing the original definitions as special cases (i.e., when c=1). We investigate the c-differential uniformity property of the inverse function over finite fields under several extended affine transformations. We demonstrate that c-differential properties do not hold in general across equivalence classes typically used in Boolean function analysis, and in some cases change significantly under slight perturbations. Thus, choosing certain affine equivalent functions that are easy to implement in hardware or software without checking their c-differential properties could potentially expose an encryption scheme to risk if a c-differential attack method is ever realized. We also extend the c-derivative and c-differential uniformity into higher order, investigate some of their properties, and analyze the behavior of the inverse function's second order c-differential uniformity. Finally, we analyze the substitution boxes of some recognizable ciphers along with certain extended affine equivalent variations and document their performance under c-differential uniformity.Commander, United States NavyApproved for public release. Distribution is unlimited
SoK: Security Evaluation of SBox-Based Block Ciphers
Cryptanalysis of block ciphers is an active and important research area with an extensive volume of literature. For this work, we focus on SBox-based ciphers, as they are widely used and cover a large class of block ciphers. While there have been prior works that have consolidated attacks on block ciphers, they usually focus on describing and listing the attacks. Moreover, the methods for evaluating a cipher\u27s security are often ad hoc, differing from cipher to cipher, as attacks and evaluation techniques are developed along the way. As such, we aim to organise the attack literature, as well as the work on security evaluation.
In this work, we present a systematization of cryptanalysis of SBox-based block ciphers focusing on three main areas: (1) Evaluation of block ciphers against standard cryptanalytic attacks; (2) Organisation and relationships between various attacks; (3) Comparison of the evaluation and attacks on existing ciphers
- …