Spin Me Right Round Rotational Symmetry for FPGA-Specific AES: Extended Version
-
Published:2020-01-22
Issue:3
Volume:33
Page:1114-1155
-
ISSN:0933-2790
-
Container-title:Journal of Cryptology
-
language:en
-
Short-container-title:J Cryptol
Author:
Wegener Felix,De Meyer Lauren,Moradi Amir
Abstract
AbstractThe effort in reducing the area of AES implementations has largely been focused on application-specific integrated circuits (ASICs) in which a tower field construction leads to a small design of the AES S-box. In contrast, a naive implementation of the AES S-box has been the status-quo on field-programmable gate arrays (FPGAs). A similar discrepancy holds for masking schemes—a well-known side-channel analysis countermeasure—which are commonly optimized to achieve minimal area in ASICs. In this paper, we demonstrate a representation of the AES S-box exploiting rotational symmetry which leads to a 50% reduction in the area footprint on FPGA devices. We present new AES implementations which improve on the state-of-the-art and explore various trade-offs between area and latency. For instance, at the cost of increasing 4.5 times the latency, one of our design variants requires 25% less look-up tables (LUTs) than the smallest known AES on Xilinx FPGAs by Sasdrich and Güneysu at ASAP 2016. We further explore the protection of such implementations against side-channel attacks. We introduce a generic methodology for masking any n-bit Boolean functions of degree t with protection order d. The methodology is exact for first-order and heuristic for higher orders. Its application to our new construction of the AES S-box allows us to improve previous results and introduce the smallest first-order masked AES implementation on Xilinx FPGAs, to date.
Funder
Ruhr-Universität Bochum
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference70 articles.
1. T. Beyne, B. Bilgin, Uniform first-order threshold implementations. in R. Avanzi and H.M. Heys, editors, Selected Areas in Cryptography—SAC 2016–23rd International Conference, St. John’s, NL, Canada, August 10–12, 2016, Revised Selected Papers, Lecture Notes in Computer Science, vol. 10532 (Springer, 2016), pp. 79–98. 2. G. Barthe, F. Dupressoir, S. Faust, B. Grégoire, F. Standaert, P.-Y. Strub, Parallel implementations of masking schemes and the bounded moment leakage model. in J.-S. Coron and J.B. Nielsen, editors, Advances in Cryptology–EUROCRYPT 2017–36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30–May 4, 2017, Proceedings, Part I, Lecture Notes in Computer Science, vol. 10210 pp. 535–566 (2017) 3. S. Bhasin, J.-L. Danger, S. Guilley, W. He, Exploiting FPGA block memories for protected cryptographic implementations. TRETS, 8(3), 16:1–16:16 (2015) 4. S. Bhasin, S. Guilley, J.-L. Danger, From cryptography to hardware: Analyzing embedded xilinx BRAM for cryptographic applications. in 45th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2012, Workshops Proceedings, Vancouver, BC, Canada, December 1–5, 2012 (IEEE Computer Society, 2012), pp. 1–8 5. B. Bilgin, B. Gierlichs, S. Nikova, V. Nikov, V. Rijmen, Trade-offs for threshold implementations illustrated on AES. IEEE Trans. on CAD of Integrated Circuits and Systems, 34(7), 1188–1200 (2015)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|