In this paper we introduce an open framework for the benchmarking of lightweight block ciphers on a multitude of embedded platforms. Our framework is able to evaluate execution time, RAM footprint, as well as (binary) code size, and allows a user to define a custom “figure of merit” according to which all evaluated candidates can be ranked. We used the framework to benchmark various implementat...

Abstract For block ciphers, Bogdanov et al. found that there are some linear approximations satisfying their biases deterministically invariant under key difference. This property is called difference bias. Based on this property, proposed a related-key statistical distinguisher and turned it into key-recovery attacks LBlock TWINE-128. In paper, we propose new model by combining multidimensiona...

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Hadi Soleimany Name of the doctoral dissertation Studies in Lightweight Cryptography Publisher School of Science Unit Department of Information and Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 211/2014 Field of research Theoretical Computer Science Manuscript submitted 26 September 2014 Da...

Impossible differential cryptanalysis has shown to be a very powerful form of cryptanalysis against block ciphers. These attacks, even if extensively used, remain not fully understood because of their high technicality. Indeed, numerous are the applications where mistakes have been discovered or where the attacks lack optimality. This paper aims in a first step at formalizing and improving this...

Impossible differential cryptanalysis has been proved to be one of the most powerful techniques to attack block ciphers. Based on the impossible differential paths, we can usually add several rounds before or after to launch the key recovery attack. Impossible differential cryptanalysis is powerful not only because the number of rounds it can break is very competitive compared to other attacks,...

Impossible differential cryptanalysis has shown to be a very powerful form of cryptanalysis against block ciphers. These attacks, even if extensively used, remain not fully understood because of their high technicality. Indeed, numerous are the applications where mistakes have been discovered or where the attacks lack optimality. This paper aims in a first step at formalizing and improving this...

Nowadays, general purpose graphical processing unit (GPGPU) has been used in many ares. We use it for security evaluation of light-weight block ciphers. Light-weight block cipher is one of key technologies for small communication devices such as sensor network. To design a light-weight block cipher whose fastness and security are balanced, so that, its security margin should be evaluated exactl...

Algebraic analysis of block ciphers aims at finding the secret key by solving a collection of polynomial equations that describe the internal structure of a cipher for chosen observations of plaintext/ciphertext pairs. Although algebraic attacks are addressed for cryptanalysis of block and stream ciphers, there is a lack of understanding of the impact of algebraic representation of the cipher o...

ElimLin is a simple algorithm for solving polynomial systems of multivariate equations over small finite fields. It was initially proposed by Courtois to attack DES. It can reveal some hidden linear equations existing in the ideal generated by the system. We report a number of key theorems on ElimLin. Our main result is to characterize ElimLin in terms of a sequence of intersections of vector s...