CryptoDB

Paper: Very High Order Masking: Efficient Implementation and Security Evaluation

Authors: Anthony Journault François-Xavier Standaert DOI: 10.1007/978-3-319-66787-4_30 Search ePrint Search Google CHES 2017 In this paper, we study the performances and security of recent masking algorithms specialized to parallel implementations in a 32-bit embedded software platform, for the standard AES Rijndael and the bitslice cipher Fantomas. By exploiting the excellent features of these algorithms for bitslice implementations, we first extend the recent speed records of Goudarzi and Rivain (presented at Eurocrypt 2017) and report realistic timings for masked implementations with 32 shares. We then observe that the security level provided by such implementations is uneasy to quantify with current evaluation tools. We therefore propose a new “multi-model” evaluation methodology which takes advantage of different (more or less abstract) security models introduced in the literature. This methodology allows us to both bound the security level of our implementations in a principled manner and to assess the risks of overstated security based on well understood parameters. Concretely, it leads us to conclude that these implementations withstand worst-case adversaries with $>\!2^{64}$ measurements under falsifiable assumptions.
BibTeX
@inproceedings{ches-2017-28939,
title={Very High Order Masking: Efficient Implementation and Security Evaluation},
booktitle={Cryptographic Hardware and Embedded Systems – CHES 2017},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={10529},
pages={623-643},
doi={10.1007/978-3-319-66787-4_30},
author={Anthony Journault and François-Xavier Standaert},
year=2017
}