Paper 2016/244

Cryptanalysis of Simpira v1

Christoph Dobraunig, Maria Eichlseder, and Florian Mendel


Simpira v1 is a recently proposed family of permutations, based on the AES round function. The design includes recommendations for using the Simpira permutations in block ciphers, hash functions, or authenticated ciphers. The designers' security analysis is based on computer-aided bounds for the minimum number of active S-boxes. We show that the underlying assumptions of independence, and thus the derived bounds, are incorrect. For family member Simpira-4, we provide differential trails with only 40 (instead of 75) active S-boxes for the recommended 15 rounds. Based on these trails, we propose full-round collision attacks on the proposed Simpira-4 Davies-Meyer hash construction, with complexity $2^{82.62}$ for the recommended full 15 rounds and a truncated 256-bit hash value, and complexity $2^{110.16}$ for 16 rounds and the full 512-bit hash value. These attacks violate the designers' security claims that there are no structural distinguishers with complexity below $2^{128}$.

Note: Accepted to SAC 2016; updated to pre-proceedings version; reference Simpira v2

Available format(s)
Secret-key cryptography
Publication info
Published elsewhere. SAC 2016
Simpirapermutation-based cryptographycryptanalysishash functionscollisions
Contact author(s)
maria eichlseder @ iaik tugraz at
2016-08-25: revised
2016-03-05: received
See all versions
Short URL
Creative Commons Attribution


      author = {Christoph Dobraunig and Maria Eichlseder and Florian Mendel},
      title = {Cryptanalysis of Simpira v1},
      howpublished = {Cryptology ePrint Archive, Paper 2016/244},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.