Towards FHE in Embedded Systems: A Preliminary Codesign Space Exploration of a HW/SW Very Large Multiplier

The integration of fully homomorphic encryption (FHE) into embedded systems is limited due to its huge computational requirements. FHE requires multiplications of operands up to millions of bits. Current implementations use high-end and parallel processors, leading to high-power consumption. We propose a hardware-software system to benefit from the best of hardware (performance/low-power) and software (flexibility) capabilities. In this letter, we present our first codesign results for hardware dedicated multiplication units, which is used as atomic operations by the software layer. We report FPGA implementation results for those units and software performance estimations of their use in multiplications up to 16 millions-bit operands. In range of 10 W power consumption, our analysis show that good FHE performance is affordable.

[1]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[2]  Yasutaka Wada,et al.  A Scalable Multiplier for Arbitrary Large Numbers Supporting Homomorphic Encryption , 2013, 2013 Euromicro Conference on Digital System Design.

[3]  Berk Sunar,et al.  A million-bit multiplier architecture for fully homomorphic encryption , 2014, Microprocess. Microsystems.

[4]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[5]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[6]  Craig Gentry,et al.  Implementing Gentry's Fully-Homomorphic Encryption Scheme , 2011, EUROCRYPT.

[7]  S. Cook,et al.  ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .

[8]  Milos D. Ercegovac,et al.  Digital Arithmetic , 2003, Wiley Encyclopedia of Computer Science and Engineering.

[9]  Craig Gentry,et al.  A fully homomorphic encryption scheme , 2009 .

[10]  Berk Sunar,et al.  Accelerating fully homomorphic encryption using GPU , 2012, 2012 IEEE Conference on High Performance Extreme Computing.

[11]  Caroline Fontaine,et al.  A Survey of Homomorphic Encryption for Nonspecialists , 2007, EURASIP J. Inf. Secur..

[12]  Jean-Sébastien Coron,et al.  Fully Homomorphic Encryption over the Integers with Shorter Public Keys , 2011, IACR Cryptol. ePrint Arch..

[13]  Earl E. Swartzlander.  The Quasi-Serial Multiplier , 1973, IEEE Transactions on Computers.