Block Ciphers – Focus on the Linear Layer (feat. PRIDE)

2014 ◽  
pp. 57-76 ◽  
Author(s):  
Martin R. Albrecht ◽  
Benedikt Driessen ◽  
Elif Bilge Kavun ◽  
Gregor Leander ◽  
Christof Paar ◽  
...  
Keyword(s):  
Block Ciphers ◽  
Linear Layer

scholarly journals Fixslicing AES-like Ciphers

2020 ◽  
pp. 402-425
Author(s):  
Alexandre Adomnicai ◽  
Thomas Peyrin
Keyword(s):  
Implementation Strategy ◽  
Block Cipher ◽  
Block Ciphers ◽  
Constant Time ◽  
Fundamental Idea ◽  
First Order ◽  
Linear Layer ◽  
Efficient Software

The fixslicing implementation strategy was originally introduced as a new representation for the hardware-oriented GIFT block cipher to achieve very efficient software constant-time implementations. In this article, we show that the fundamental idea underlying the fixslicing technique is not of interest only for GIFT, but can be applied to other ciphers as well. Especially, we study the benefits of fixslicing in the case of AES and show that it allows to reduce by 52% the amount of operations required by the linear layer when compared to the current fastest bitsliced implementation on 32-bit platforms. Overall, we report that fixsliced AES-128 allows to reach 80 and 91 cycles per byte on ARM Cortex-M and E31 RISC-V processors respectively (assuming pre-computed round keys), improving the previous records on those platforms by 21% and 26%. In order to highlight that our work also directly improves masked implementations that rely on bitslicing, we report implementation results when integrating first-order masking that outperform by 12% the fastest results reported in the literature on ARM Cortex-M4. Finally, we demonstrate the genericity of the fixslicing technique for AES-like designs by applying it to the Skinny-128 tweakable block ciphers.

scholarly journals Revisiting Impossible Differential Distinguishers of Two Generalized Feistel Structures

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Xuan Shen ◽  
Lei Cheng ◽  
Bing Sun ◽  
Jun He
Keyword(s):  
Block Ciphers ◽  
Differential Attack ◽  
Negative Numbers ◽  
Round Function ◽  
Linear Layer ◽  
Impossible Differential ◽  
Impossible Differential Attack

Impossible differential attack is one of the most effective cryptanalytic methods for block ciphers. Its key step is to construct impossible differential distinguishers as long as possible. In this paper, we mainly focus on constructing longer impossible differential distinguishers for two kinds of generalized Feistel structures which are m -dataline CAST256-like and MARS-like structures. When their round function takes Substitution Permutation SP and Substitution Permutation Substitution SPS types, they are called CAST 256 SP / CAST 256 SPS and MARS SP / MARS SPS , respectively. For CAST 256 SP / CAST 256 SPS , the best known result for the length of the impossible differential distinguisher was m 2 + m / m 2 + m − 1 rounds, respectively. With the help of the linear layer P , we can construct m 2 + m + Λ 0 / m 2 + m + Λ 1 -round impossible differential distinguishers, where Λ 0 and Λ 1 are non-negative numbers if P satisfies some restricted conditions. For MARS SPS , the best known result for the length of the impossible differential distinguisher was 3 m − 1 rounds. We can construct 3 m -round impossible differential distinguishers which are 1 round longer than before. To our knowledge, the results in this paper are the best for the two kinds of generalized Feistel structures.

scholarly journals Fixslicing: A New GIFT Representation

2020 ◽  
pp. 402-427
Author(s):  
Alexandre Adomnicai ◽  
Zakaria Najm ◽  
Thomas Peyrin
Keyword(s):  
Block Ciphers ◽  
Constant Time ◽  
Trivial Representation ◽  
Cryptographic Primitives ◽  
Lightweight Cryptography ◽  
Linear Layer ◽  
The Gift ◽  
Software Implementations ◽  
Efficient Software ◽  
Hardware Performance

The GIFT family of lightweight block ciphers, published at CHES 2017, offers excellent hardware performance figures and has been used, in full or in part, in several candidates of the ongoing NIST lightweight cryptography competition. However, implementation of GIFT in software seems complex and not efficient due to the bit permutation composing its linear layer (a feature shared with PRESENT cipher). In this article, we exhibit a new non-trivial representation of the GIFT family of block ciphers over several rounds. This new representation, that we call fixslicing, allows extremely efficient software bitsliced implementations of GIFT, using only a few rotations, surprisingly placing GIFT as a very efficient candidate on micro-controllers. Our constant time implementations show that, on ARM Cortex-M3, 128-bit data can be ciphered with only about 800 cycles for GIFT-64 and about 1300 cycles for GIFT-128 (assuming pre-computed round keys). In particular, this is much faster than the impressive PRESENT implementation published at CHES 2017 that requires 2116 cycles in the same setting, or the current best AES constant time implementation reported that requires 1617 cycles. This work impacts GIFT, but also improves software implementations of all other cryptographic primitives directly based on it or strongly related to it.

Hash Functions Based on Block Ciphers

2009 ◽  
Vol 20 (3) ◽  
pp. 682-691
Author(s):  
Pin LIN ◽  
Wen-Ling WU ◽  
Chuan-Kun WU
Keyword(s):  
Hash Functions ◽  
Block Ciphers

A New Statistical Test on Block Ciphers

2009 ◽  
Vol 32 (4) ◽  
pp. 595-601 ◽  
Author(s):  
Hua CHEN ◽  
Deng-Guo FENG ◽  
Li-Min FAN
Keyword(s):  
Block Ciphers ◽  
Statistical Test

Architectural Supports for Block Ciphers in a RISC CPU Core by Instruction Overloading

2021 ◽  
pp. 1-1
Author(s):  
Piljoo Choi ◽  
Wonbae Kong ◽  
Ji-Hoon Kim ◽  
Mun-Kyu Lee ◽  
Dong Kyue Kim
Keyword(s):  
Block Ciphers

scholarly journals Six shades lighter: a bit-serial implementation of the AES family

2021 ◽  
Author(s):  
Sergio Roldán Lombardía ◽  
Fatih Balli ◽  
Subhadeep Banik
Keyword(s):  
Block Cipher ◽  
Block Ciphers ◽  
Authenticated Encryption ◽  
Current Standard ◽  
Asic Circuit ◽  
The Family ◽  
Encryption And Decryption ◽  
Preliminary Version ◽  
Reduction In Area ◽  
Bit Serial

AbstractRecently, cryptographic literature has seen new block cipher designs such as , or that aim to be more lightweight than the current standard, i.e., . Even though family of block ciphers were designed two decades ago, they still remain as the de facto encryption standard, with being the most widely deployed variant. In this work, we revisit the combined one-in-all implementation of the family, namely both encryption and decryption of each as a single ASIC circuit. A preliminary version appeared in Africacrypt 2019 by Balli and Banik, where the authors design a byte-serial circuit with such functionality. We improve on their work by reducing the size of the compact circuit to 2268 GE through 1-bit-serial implementation, which achieves 38% reduction in area. We also report stand-alone bit-serial versions of the circuit, targeting only a subset of modes and versions, e.g., and . Our results imply that, in terms of area, and can easily compete with the larger members of recently designed family, e.g., , . Thus, our implementations can be used interchangeably inside authenticated encryption candidates such as , or in place of .

Sign in / Sign up

Export Citation Format

Share Document