SKINNY

The πš‚π™Ίπ™Έπ™½π™½πšˆ family of block ciphers and its low-latency variant π™Όπ™°π™½πšƒπ™Έπš‚. We present a new tweakable block cipher family πš‚π™Ίπ™Έπ™½π™½πšˆ, whose goal is to compete with NSA recent design πš‚π™Έπ™Όπ™Ύπ™½ in terms of hardware/software performances, while proving in addition much stronger security guarantees with regards to differential/linear attacks. In particular, unlike πš‚π™Έπ™Όπ™Ύπ™½, we are able to provide strong bounds for all versions, and not only in the single-key model, but also in the related-key or related-tweak model. πš‚π™Ίπ™Έπ™½π™½πšˆ has flexible block/key/tweak sizes and can also benefit from very efficient threshold implementations for side-channel protection. Regarding performances, it outperforms all known ciphers for ASIC round-based implementations, while still reaching an extremely small area for serial implementations and a very good efficiency for software and micro-controllers implementations (πš‚π™Ίπ™Έπ™½π™½πšˆ has the smallest total number of AND/OR/XOR gates used for encryption process). Secondly, we present π™Όπ™°π™½πšƒπ™Έπš‚, a dedicated variant of πš‚π™Ίπ™Έπ™½π™½πšˆ for low-latency implementations, that constitutes a very efficient solution to the problem of designing a tweakable block cipher for memory encryption. π™Όπ™°π™½πšƒπ™Έπš‚ basically reuses well understood, previously studied, known components. Yet, by putting those components together in a new fashion, we obtain a competitive cipher to π™Ώπšπ™Έπ™½π™²π™΄ in latency and area, while being enhanced with a tweak input.


References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Chen, Shiyao; Fan, Yanhong; Sun, Ling; Fu, Yong; Zhou, Haibo; Li, Yongqing; Wang, Meiqin; Wang, Weijia; Guo, Chun: SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations (2022)
  2. Dunkelman, Orr; Huang, Senyang; Lambooij, Eran; Perle, Stav: Biased differential distinguisher -- cryptanalysis of reduced-round \textscSKINNY (2021)
  3. Jean, Jérémy; Nikolić, Ivica; Peyrin, Thomas; Seurin, Yannick: The \textttDeoxysAEAD family (2021)
  4. Wang, Qian; Jin, Chenhui: Bounding the length of impossible differentials for SPN block ciphers (2021)
  5. Beyne, Tim: Block cipher invariants as eigenvectors of correlation matrices (2020)
  6. Chakraborti, Avik; Iwata, Tetsu; Minematsu, Kazuhiko; Nandi, Mridul: Blockcipher-based authenticated encryption: how small can we go? (2020)
  7. Dinur, Itai: Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem (2020)
  8. Gerault, David; Lafourcade, Pascal; Minier, Marine; Solnon, Christine: Computing AES related-key differential characteristics with constraint programming (2020)
  9. Jha, Ashwin; Nandi, Mridul: Tight security of cascaded LRW2 (2020)
  10. Lambin, Baptiste; Derbez, Patrick; Fouque, Pierre-Alain: Linearly equivalent s-boxes and the division property (2020)
  11. Roh, Dongyoung; Koo, Bonwook; Jung, Younghoon; Jeong, Il Woong; Lee, Dong-Geon; Kwon, Daesung; Kim, Woo-Hwan: Revised version of block cipher CHAM (2020)
  12. Zhao, Boxin; Dong, Xiaoyang; Meier, Willi; Jia, Keting; Wang, Gaoli: Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT (2020)
  13. Sadeghi, Sadegh; Bagheri, Nasour: Security analysis of SIMECK block cipher against related-key impossible differential (2019)
  14. Forler, Christian; List, Eik; Lucks, Stefan; Wenzel, Jakob: \textscPOEx: a beyond-birthday-bound-secure on-line cipher (2018)
  15. Liu, Yunwen; Rijmen, Vincent: New observations on invariant subspace attack (2018)
  16. Banik, Subhadeep; Pandey, Sumit Kumar; Peyrin, Thomas; Sasaki, Yu; Sim, Siang Meng; Todo, Yosuke: GIFT: a small present. Towards reaching the limit of lightweight encryption (2017)
  17. Jean, JΓ©rΓ©my; Moradi, Amir; Peyrin, Thomas; Sasdrich, Pascal: Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY (2017)
  18. Sasaki, Yu; Todo, Yosuke: New impossible differential search tool from design and cryptanalysis aspects. Revealing structural properties of several ciphers (2017)
  19. Tolba, Mohamed; Abdelkhalek, Ahmed; Youssef, Amr M.: Impossible differential cryptanalysis of reduced-round \textttSKINNY (2017)
  20. Zheng, Yafei; Wu, Wenling: Biclique attack of block cipher \textttSKINNY (2017)

1 2 next