Paper 2023/1020
At Last! A Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE
Abstract
Since the pioneering work of Gentry, Halevi, and Smart in 2012, the state of the art on transciphering has moved away from work on AES to focus on new symmetric algorithms that are better suited for a homomorphic execution. Yet, with recent advances in homomorphic cryptosystems, the question arises as to where we stand today. Especially since AES execution is the application that may be chosen by NIST in the FHE part of its future call for threshold encryption. In this paper, we propose an AES implementation using TFHE programmable bootstrapping which runs in less than a minute on an average laptop. We detail the transformations carried out on the original AES code to lead to a more efficient homomorphic evaluation and we also give several execution times on different machines, depending on the type of execution (sequential or parallelized). These times vary from 4.5 minutes (resp. 54 secs) for sequential (resp. parallel) execution on a standard laptop down to 28 seconds for a parallelized execution over 16 threads on a multi-core workstation.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. WAHC'23
- Keywords
- AESFully Homomorphic EncryptionTranscipheringTFHEProgrammable Bootstrapping
- Contact author(s)
-
daphne trama @ cea fr
pierre-emmanuel clet @ cea fr
aymen boudguiga @ cea fr
renaud sirdey @ cea fr - History
- 2024-03-22: last of 4 revisions
- 2023-06-30: received
- See all versions
- Short URL
- https://ia.cr/2023/1020
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1020, author = {Daphné Trama and Pierre-Emmanuel Clet and Aymen Boudguiga and Renaud Sirdey}, title = {At Last! A Homomorphic {AES} Evaluation in Less than 30 Seconds by Means of {TFHE}}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1020}, year = {2023}, url = {https://eprint.iacr.org/2023/1020} }