• Corpus ID: 8595056

Cryptanalysis of the SIMON Family of Block Ciphers

@article{AlKhzaimi2013CryptanalysisOT,
  title={Cryptanalysis of the SIMON Family of Block Ciphers},
  author={Hoda AlKhzaimi and Martin M. Lauridsen},
  journal={IACR Cryptol. ePrint Arch.},
  year={2013},
  volume={2013},
  pages={543}
}
Recently, the U.S National Security Agency has published the specications of two families of lightweight block ciphers, SIMON and SPECK, on ePrint (2). The ciphers are developed with optimization towards both hardware and software in mind. While the spec- ication paper discusses design requirements and performance of the presented lightweight ciphers thoroughly, no security assessment is given. This paper is a move towards lling that cryptanalysis gap for the SIMON family of ciphers. We present… 
Cryptanalysis of the Speck Family of Block Ciphers
TLDR
This paper presents differential and rectangle attacks for almost all members of the Speck family of ciphers, where up to 11/22, 12/23, 15/27,15/29, and 18/34 rounds of the 32-, 48-, 64-, 96-, and 128-bit version, respectively.
Improved Differential Cryptanalysis of Round-Reduced Speck
  • Itai Dinur
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2014
TLDR
The best previously published attacks on all the 20 round-reduced ciphers are differential attacks, and are described in two papers (presented at FSE 2014) by Abed et al. and Biryukov etAl.
Improved Linear Trails for the Block Cipher Simon
  • T. Ashur
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2015
TLDR
This work improves previously published linear trail bias estimations by presenting a novel method to calculate the bias of short linear hulls in Simon and use them to construct longer linear approximations.
Linear Cryptanalysis of Round Reduced SIMON
TLDR
This paper analyzes the security of SIMON against linear cryptanalysis, and presents several linear characteristics for all variants ofSIMON with reduced number of rounds.
Analysis on Differential Properties of the Round Function of SIMON Family of Block Ciphers
TLDR
This paper completely figures out the differential distribution of the round function F(x) and proves that, for a fixed input difference, the output differential probability can only be 0 and 2 -r (1<r<n).
Design and analysis of lightweight block ciphers: a focus on the linear layer
TLDR
The scope of this work is to study the linear operation with regard to optimized efficiency and necessary security requirements and the derivation of a security argument for the block cipher Simon that does not rely on computer-aided methods.
Fault Analysis on SIMON Family of Lightweight Block Ciphers
TLDR
This paper is the first to show how to extract the entire secret key for all parameters in the Simon family using a practical fault model based on random faults, and gives new insight into the field of fault analysis.
Improved Linear Cryptanalysis of Round Reduced SIMON
TLDR
This work presents a connection between linear characteristic and differential characteristic, multiple linear and differential and linear hull and differential, and employs it to adapt the current known results on differential cryptanalysis of SIMON to linear crypt analysis of this block cipher.
Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON
TLDR
This paper mainly presents zero-correlation linear cryptanalysis on various versions of SIMON, and uses the divide-and-conquer technique to improve the results of linear crypt analysis proposed by Javad et al. in ePrint Report 2013/663.
Statistical Analysis on Lightweight Block Cipher , S IMON
TLDR
From the analysis conducted, it is conclude that the outputs from the sample tested on the algorithms are non-random.
...
...

References

SHOWING 1-10 OF 26 REFERENCES
Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
TLDR
Improve upon existing approaches in order to derive better bounds on the EDP for two and four rounds of AES based on a slightly simplified S-box and methods to improve the estimates for the E DP in the case of six active S-boxes are improved.
Differential cryptanalysis of DES-like cryptosystems
TLDR
A new type of cryptanalytic attack is developed which can break the reduced variant of DES with eight rounds in a few minutes on a personal computer and can break any reduced variantof DES (with up to 15 rounds) using less than 256 operations and chosen plaintexts.
The LED Block Cipher
TLDR
This work considers the resistance of ciphers, and LED in particular, to related-key attacks, and is able to derive simple yet interesting AES-like security proofs for LED regarding related- or single- key attacks.
Rotational Cryptanalysis of ARX
TLDR
This paper analyzes the security of systems based on modular additions, rotations, and XORs (ARX systems) and proves that ARX with constants are functionally complete, i.e. any function can be realized with these operations.
Miss in the Middle Attacks on IDEA and Khufu
TLDR
The application of a new cryptanalytic technique based on impossible differentials to the block ciphers IDEA and Khufu shows that it is applicable to a larger class of cryptosystems, and develops new technical tools for applying it in new situations.
The Data Encryption Standard (DES) and its strength against attacks
TLDR
Some of the safeguards against differential cryptanalysis that were built into the DES system from the beginning are shown, with the result that more than 10 15 bytes of chosen plaintext are required for this attack to succeed.
KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers
TLDR
A new family of very efficient hardware oriented block ciphers divided into two flavors, which is more compact in hardware, as the key is burnt into the device (and cannot be changed), and achieves encryption speed of 12.5 KBit/sec.
ICEBERG : An Involutional Cipher Efficient for Block Encryption in Reconfigurable Hardware
TLDR
The resulting design offers better hardware efficiency than other recent 128-key-bit block ciphers and Resistance against side-channel cryptanalysis was also considered as a design criteria for ICEBERG.
Rotational Rebound Attacks on Reduced Skein
TLDR
This paper applies a new compositional attack to the reduced version of the hash function Skein, a finalist of the SHA-3 competition, and formally proves that such a property cannot be found for an ideal cipher within the complexity limits of the attack.
PRESENT: An Ultra-Lightweight Block Cipher
TLDR
An ultra-lightweight block cipher, present, which is competitive with today's leading compact stream ciphers and suitable for extremely constrained environments such as RFID tags and sensor networks.
...
...