Paper 2014/233
Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince
Yarkın Doröz, Aria Shahverdi, Thomas Eisenbarth, and Berk Sunar
Abstract
We present the homomorphic evaluation of the Prince block cipher. Our leveled implementation is based on a generalization of NTRU. We are motivated by the drastic bandwidth savings that may be achieved by scheme conversion. To unlock this advantage we turn to lightweight ciphers such as Prince. These ciphers were designed from scratch to yield fast and compact implementations on resource constrained embedded platforms. We show that some of these ciphers have the potential to enable near practical homomorphic evaluation of block ciphers. Indeed, our analysis shows that Prince can be implemented using only a 24 level deep circuit. Using an NTRU based implementation we achieve an evaluation time of 3.3 seconds per Prince block – one and two orders of magnitude improvement over homomorphic AES implementations achieved using NTRU, and BGV-style homomorphic encryption libraries, respectively.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. 2nd Workshop on Applied Homomorphic Cryptography and Encrypted Computing - WAHC'14
- Keywords
- Homomorphic encryptionNTRUPrincelightweight blockciphers
- Contact author(s)
- sunar @ wpi edu
- History
- 2014-04-01: received
- Short URL
- https://ia.cr/2014/233
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/233,
author = {Yarkın Doröz and Aria Shahverdi and Thomas Eisenbarth and Berk Sunar},
title = {Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/233},
year = {2014},
url = {https://eprint.iacr.org/2014/233}
}
