Description
We present a new tweakable block cipher family SKINNY, whose goal is to compete with NSA recent design SIMON in terms of hardware/software performances, while proving in addition stronger security guarantees with regards to differential/linear attacks.<br/> SKINNY has flexible block/key/tweak sizes and can also benefit from very efficient threshold implementations for side-channels protection. Regarding performances, it outperforms all known ciphers for ASIC round-based implementations and offers very competitive bit-sliced software implementations in CTR mode (as theoretically predicted since SKINNY has the smallest total number of AND/OR/XOR gates used for encryption process).<br/> Additionally, we introduce MANTIS, a dedicated variant of SKINNY for low-latency implementations, that constitutes a very efficient solution to the problem of designing a tweakable block cipher for memory encryption. MANTIS competes with PRINCE in latency and area, while being enhanced with a tweak input.<br/> Joint work with: C. Beierle, S. Kölbl, G. Leander, A. Moradi, T. Peyrin, Y. Sasaki, P. Sasdrich, S.M. Sim To appear in CRYPTO 2016
Prochains exposés
-
MIKE: An efficient and compact NIKE Based on a Commutative Monoidal Action
Orateur : Jonathan Komada Eriksen - COSIC, KU Leuven
Robert recently described a powerful correspondence between certain (Hermitian) modules and (polarized) abelian varieties, which simultaneously generalizes both the class-group action underlying protocols such as CSIDH, and the Deuring correspondence, underlying protocols such as SQIsign. Using this correspondence, he also proposed how to construct a post-quantum NIKE, called MIKE, which, at a[…]-
Cryptography
-
-
TBA
Orateur : Anmoal Porwal - Technical University of Munich
-
Cryptography
-
Asymmetric primitive
-