Paper 2023/980
Trivial Transciphering With Trivium and TFHE
, Zama, COSIC, KU Leuven, ZamaAbstract
We examine the use of Trivium and Kreyvium as transciphering mechanisms for use with the TFHE FHE scheme. Originally these two ciphers were investigated for FHE transciphering only in the context of the BGV/BFV FHE schemes; this is despite Trivium and Kreyvium being particarly suited to TFHE. Recent work by Dobraunig et al. gave some initial experimental results using TFHE. We show that these two symmetric ciphers have excellent performance when homomorphically evaluated using TFHE. Indeed we improve upon the results of Dobraunig et al. by at least two orders of magnitude in terms of latency. This shows that, for TFHE at least, one can transcipher using a standardized symmetric cipher (Trivium), without the need for special FHE-friendly ciphers being employed. For applications wanting extra security, but without the benefit of relying on a standardized cipher, our work shows that Kreyvium is a good candidate.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. WAHC 2023
- DOI
- 10.1145/3605759.3625255
- Keywords
- FHEtranscipheringTrivium
- Contact author(s)
-
thibault balenbois @ zama ai
jb orfila @ zama ai
nigel smart @ kuleuven be - History
- 2023-09-21: revised
- 2023-06-23: received
- See all versions
- Short URL
- https://ia.cr/2023/980
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/980,
author = {Thibault Balenbois and Jean-Baptiste Orfila and Nigel P. Smart},
title = {Trivial Transciphering With Trivium and TFHE},
howpublished = {Cryptology ePrint Archive, Paper 2023/980},
year = {2023},
doi = {10.1145/3605759.3625255},
note = {\url{https://eprint.iacr.org/2023/980}},
url = {https://eprint.iacr.org/2023/980}
}
