Block Ciphers That Are Easier to Mask: How Far Can We Go?
The design and analysis of lightweight block ciphers has been a very active research area over the last couple of years, with many innovative proposals trying to optimize different performance figures. However, since these block ciphers are dedicated to low-cost embedded devices, their implementation is also a typical target for side-channel adversaries. As preventing such attacks with countermeasures usually implies significant performance overheads, a natural open problem is to propose new algorithms for which physical security is considered as an optimization criteria, hence allowing better performances again. We tackle this problem by studying how much we can tweak standard block ciphers such as the AES Rijndael in order to allow efficient masking (that is one of the most frequently considered solutions to improve security against side-channel attacks). For this purpose, we first investigate alternative S-boxes and round structures. We show that both approaches can be used separately in order to limit the total number of non-linear operations in the block cipher, hence allowing more efficient masking. We then combine these ideas into a concrete instance of block cipher called Zorro. We further provide a detailed security analysis of this new cipher taking its design specificities into account, leading us to exploit innovative techniques borrowed from hash function cryptanalysis (that are sometimes of independent interest). Eventually, we conclude the paper by evaluating the efficiency of masked Zorro implementations in an 8-bit microcontroller, and exhibit their interesting performance figures.
Unable to display preview. Download preview PDF.
- 1.Barreto, P., Rijmen, V.: The KHAZAD legacy-level block cipher. Primitive Submitted to NESSIE, 4 (2000)Google Scholar
- 2.Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2–21. Springer, Heidelberg (1991)Google Scholar
- 4.Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: An ultra-lightweight block cipher. In: Paillier, Verbauwhede (eds.) , pp. 450–466Google Scholar
- 10.Coron, J.-S., Prouff, E., Rivain, M.: Side channel cryptanalysis of a higher order masking scheme. In: Paillier and Verbauwhede , pp. 28–44Google Scholar
- 11.Daemen, J., Peeters, M., Assche, G.V., Rijmen, V.: Nessie proposal: NOEKEON (2000), http://gro.noekeon.org/Noekeon-spec.pdf
- 12.Daemen, J., Rijmen, V.: Rijndael candidate for AES. In: AES Candidate Conference, pp. 343–348 (2000)Google Scholar
- 15.Guo, J., Peyrin, T., Poschmann, A., Robshaw, M.J.B.: The LED block cipher. In: Preneel and Takagi , pp. 326–341Google Scholar
- 17.Kim, H., Hong, S., Lim, J.: A fast and provably secure higher-order masking of AES s-box. In: Preneel and Takagi , pp. 95–107Google Scholar
- 28.Prouff, E., Roche, T.: Higher-order glitches free implementation of the AES using secure multi-party computation protocols. In: Preneel and Takagi , pp. 63–78Google Scholar
- 29.Rijmen, V., Barreto, P.: Nessie proposal: KHAZAD (2000), http://www.larc.usp.br/~pbarreto/KhazadPage.html
- 36.Whitnall, C., Oswald, E., Standaert, F.-X.: The myth of generic DPA.and the magic of learning. Cryptology ePrint Archive, Report 2012/256 (2012), http://eprint.iacr.org/