Generic Attacks on Symmetric Ciphers

2006 ◽  
pp. 7-7
Author(s):  
Palash Sarkar
Keyword(s):  
Symmetric Ciphers ◽  
Generic Attacks

On Hardware Implementation of Balanced S-boxes

2021 ◽  
Vol 12 (1) ◽  
pp. 8-20
Author(s):  
E. A. Kurganov ◽  
Keyword(s):  
Boolean Functions ◽  
Hardware Implementation ◽  
Circuit Complexity ◽  
Lookup Table ◽  
Synthesis Methods ◽  
Main Indicator ◽  
Non Linear ◽  
Symmetric Ciphers ◽  
Depth And Complexity ◽  
Selection Of

An S-box is a non-linear transformation that takes n bits as input and returns m bits. This transformation is most easily represented as a nm lookup table. Most often, only balanced S-boxes are used in cryptography. This means that the number of input bits is equal to the number of output bits. The S-box is an important part of most symmetric ciphers. The selection of the correct substitution makes the link between the key and the ciphertext more complex (non-linear), which makes it much more difficult to hack. This paper deals with a hardware implementation of S-boxes. This implementation can be realized by using logical conjunction, disjunction, negation and delay blocks. The main indicator of productivity of such implementations is a circuit depth, namely the maximum length of a simple way of the circuit and a circuit complexity, namely the quantity of logic elements (negation elements are not taken into account). The article considers the standard synthesis methods (based on DNF, Shannon, Lupanov), proposes a new algorithm to minimize the complexity of an arbitrary Boolean functions system and a way to reduce the complexity of the circuit obtained after simplification by the ESPRESSO algorithm of DNF of the function related to the output of the S-box. To compare the efficiency of the methods, the C++ program was created that generates a circuit in the Verilog language. The estimates of depth and complexity are obtained for the schemes produced as a result of the programs operation. The article ends with a comparison of the efficiency of S-box schemes of known cryptographic standards obtained as the output of the program (with each other and with the result of the Logic Friday program).

Analysis of Stream Modes for Block Symmetric Ciphers

2021 ◽  
pp. 65-98
Author(s):  
Alexandr Alexandrovich Kuznetsov ◽  
Oleksandr Volodymyrovych Potii ◽  
Nikolay Alexandrovich Poluyanenko ◽  
Yurii Ivanovich Gorbenko ◽  
Natalia Kryvinska
Keyword(s):  
Symmetric Ciphers

Generic Attacks on Classical Feistel Ciphers

2017 ◽  
pp. 65-73
Author(s):  
Valerie Nachef ◽  
Jacques Patarin ◽  
Emmanuel Volte
Keyword(s):  
Generic Attacks ◽  
Feistel Ciphers

On the security of symmetric ciphers based on DNA coding

2014 ◽  
Vol 289 ◽  
pp. 254-261 ◽  
Author(s):  
Yushu Zhang ◽  
Di Xiao ◽  
Wenying Wen ◽  
Kwok-Wo Wong
Keyword(s):  
Dna Coding ◽  
Symmetric Ciphers
Sign in / Sign up

Export Citation Format

Share Document