More Web Proxy on the site http://driver.im/

short-paper

Open access

Intel HEXL: Accelerating Homomorphic Encryption with Intel AVX512-IFMA52

Authors:

Fillipe D.M. de Souza,

Vinodh GopalAuthors Info & Claims

WAHC '21: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography

Pages 57 - 62

https://doi.org/10.1145/3474366.3486926

Published: 15 November 2021 Publication History

Abstract

Modern implementations of homomorphic encryption (HE) rely heavily on polynomial arithmetic over a finite field. This is particularly true of the BGV, BFV, and CKKS HE schemes. Two of the biggest performance bottlenecks in HE primitives and applications are polynomial modular multiplication and the forward and inverse number-theoretic transform (NTT). Here, we introduce Intel® Homomorphic Encryption Acceleration Library (Intel® HEXL), a C++ library which provides optimized implementations of polynomial arithmetic for Intel® processors. Intel HEXL takes advantage of the recent Intel® Advanced Vector Extensions 512 (Intel® AVX512) instruction set to provide state-of-the-art implementations of the NTT and modular multiplication, measuring up to 7.2x single-threaded speedup over a native C++ baseline. Intel HEXL is available open-source at https://github.com/intel/hexl under the Apache 2.0 license and has been adopted by the Microsoft SEAL and PALISADE homomorphic encryption libraries

References

[1]

Carlos Aguilar-Melchor, Joris Barrier, Serge Guelton, Adrien Guinet, Marc-Olivier Killijian, and Tancrede Lepoint. 2016. NFLlib: NTT-based fast lattice library. In Cryptographers' Track at the RSA Conference. Springer, 341--356.

Digital Library

[2]

Flavio Bergamaschi, Shai Halevi, Tzipora T Halevi, and Hamish Hunt. 2019. Homomorphic Training of 30,000 Logistic Regression Models. In International Conference on Applied Cryptography and Network Security. Springer, 592--611.

Digital Library

[3]

Marcelo Blatt, Alexander Gusev, Yuriy Polyakov, and Shafi Goldwasser. 2020. Se- cure large-scale genome-wide association studies using homomorphic encryption. Proceedings of the National Academy of Sciences 117, 21 (2020), 11608--11613.

[4]

Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT) 6, 3 (2014), 1--36.

Digital Library

[5]

Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2017. Homo- morphic encryption for arithmetic of approximate numbers. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 409--437.

[6]

James W Cooley and John W Tukey. 1965. An algorithm for the machine cal- culation of complex Fourier series. Mathematics of computation 19, 90 (1965), 297--301.

[7]

Intel Corporation. 2021. Intel Intrinsics Guide. (2021). Retrieved 2021-06-11 from https://software.intel.com/sites/landingpage/IntrinsicsGuide/#avx512techs=AVX512IFMA52

[8]

Nir Drucker and Shay Gueron. 2019. Fast modular squaring with AVX512IFMA. In 16th International Conference on Information Technology-New Generations (ITNG 2019). Springer, 3--8.

[9]

Takuya Edamatsu and Daisuke Takahashi. 2019. Accelerating Large Integer Mul- tiplication Using Intel AVX-512IFMA. In International Conference on Algorithms and Architectures for Parallel Processing. Springer, 60--74.

[10]

Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2012/144. (2012). https://eprint.iacr.org/2012/144.

[11]

Kjell Magne Fauske. 2006. Texample.net. (2006). Retrieved 2021-06-11 from https://texample.net/tikz/examples/radix2fft/

[12]

Pierre Fortin, Ambroise Fleury, François Lemaire, and Michael Monagan. 2020. High performance SIMD modular arithmetic for polynomial evaluation. arXiv preprint arXiv:2004.11571 (2020).

[13]

Rémi Géraud, Diana Maimuţ, and David Naccache. 2016. Double-speed barrett moduli. In The New Codebreakers. Springer, 148--158.

Digital Library

[14]

Shay Gueron and Vlad Krasnov. 2016. Accelerating big integer arithmetic using intel IFMA extensions. In 2016 IEEE 23nd Symposium on Computer Arithmetic (ARITH). IEEE, 32--38.

[15]

David Harvey. 2014. Faster arithmetic for number-theoretic transforms. Journal of Symbolic Computation 60 (2014), 113--119.

Digital Library

[16]

Joris Van Der Hoeven, Grégoire Lecerf, and Guillaume Quintin. 2016. Modular SIMD arithmetic in Mathemagix. ACM Transactions on Mathematical Software (TOMS) 43, 1 (2016), 1--37.

Digital Library

[17]

Wonkyung Jung, Eojin Lee, Sangpyo Kim, Jongmin Kim, Namhoon Kim, Keewoo Lee, Chohong Min, Jung Hee Cheon, and Jung Ho Ahn. 2021. Accelerating Fully Homomorphic Encryption Through Architecture-Centric Analysis and Optimization. IEEE Access 9 (2021), 98772--98789.

[18]

Ovunc Kocabas and Tolga Soyata. 2020. Towards privacy-preserving medical cloud computing using homomorphic encryption. In Virtual and Mobile Health-care: Breakthroughs in Research and Practice. IGI Global, 93--125.

[19]

Patrick Longa and Michael Naehrig. 2016. Speeding up the number theoretic transform for faster ideal lattice-based cryptography. In International Conference on Cryptology and Network Security. Springer, 124--139.

Digital Library

[20]

Kurt Rohloff. 2018. The PALISADE Lattice Cryptography Library. (2018). Retrieved 2021-06-11 from https://palisade-crypto.org/software-library/

[21]

SEAL 2020. Microsoft SEAL (release 3.6). https://github.com/Microsoft/SEAL. (Nov. 2020). Microsoft Research, Redmond, WA.

[22]

Victor Shoup et al. 2001. NTL: A library for doing number theory. (2001).

Cited By

Luo MWang M(2025)Faster Spiral: Low-Communication, High-Rate Private Information RetrievalCryptography10.3390/cryptography90100139:1(13)Online publication date: 21-Feb-2025
https://doi.org/10.3390/cryptography9010013
Zhang NFranchetti FDoerfert JGrosser TLeather HSadayappan P(2025)Code Generation for Cryptographic Kernels using Multi-word Modular Arithmetic on GPUProceedings of the 23rd ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3696443.3708948(476-492)Online publication date: 1-Mar-2025
https://dl.acm.org/doi/10.1145/3696443.3708948
Jayashankar SChen ETang TZheng WSkarlatos DEeckhout LSmaragdakis GLiang KSampson AKim MRossbach C(2025)Cinnamon: A Framework for Scale-Out Encrypted AIProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3669940.3707260(133-150)Online publication date: 30-Mar-2025
https://dl.acm.org/doi/10.1145/3669940.3707260
Show More Cited By

Index Terms

Intel HEXL: Accelerating Homomorphic Encryption with Intel AVX512-IFMA52
1. Mathematics of computing
  1. Mathematical software
    1. Mathematical software performance

Recommendations

Chosen ciphertext secure keyed-homomorphic public-key cryptosystems

In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can "freely" perform the operation inevitably means ...
Hecate: performance-aware scale optimization for homomorphic encryption compiler
CGO '22: Proceedings of the 20th IEEE/ACM International Symposium on Code Generation and Optimization

Despite the benefit of Fully Homomorphic Encryption (FHE) that supports encrypted computation, writing an efficient FHE application is challenging due to magnitude scale management. Each FHE operation increases scales of ciphertext and leaving the ...
CHET: an optimizing compiler for fully-homomorphic neural-network inferencing
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

Fully Homomorphic Encryption (FHE) refers to a set of encryption schemes that allow computations on encrypted data without requiring a secret key. Recent cryptographic advances have pushed FHE into the realm of practical applications. However, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WAHC '21: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography

November 2021

75 pages

ISBN:9781450386562

DOI:10.1145/3474366

Program Chairs:
Michael Brenner
Leibniz Universität Hannover, Germany
,
Rachel Player
Royal Holloway, University of London, UK
,
Kurt Rohloff
NJIT and Duality Technologies, USA

Copyright © 2021 Owner/Author.

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives International 4.0 License.

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 November 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CCS '21

Sponsor:

SIGSAC

CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security

November 15, 2021

Virtual Event, Republic of Korea

Acceptance Rates

Overall Acceptance Rate 6 of 17 submissions, 35%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
1,093
Total Downloads

Downloads (Last 12 months)308
Downloads (Last 6 weeks)34

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Luo MWang M(2025)Faster Spiral: Low-Communication, High-Rate Private Information RetrievalCryptography10.3390/cryptography90100139:1(13)Online publication date: 21-Feb-2025
https://doi.org/10.3390/cryptography9010013
Zhang NFranchetti FDoerfert JGrosser TLeather HSadayappan P(2025)Code Generation for Cryptographic Kernels using Multi-word Modular Arithmetic on GPUProceedings of the 23rd ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3696443.3708948(476-492)Online publication date: 1-Mar-2025
https://dl.acm.org/doi/10.1145/3696443.3708948
Jayashankar SChen ETang TZheng WSkarlatos DEeckhout LSmaragdakis GLiang KSampson AKim MRossbach C(2025)Cinnamon: A Framework for Scale-Out Encrypted AIProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3669940.3707260(133-150)Online publication date: 30-Mar-2025
https://dl.acm.org/doi/10.1145/3669940.3707260
Takahashi D(2025)Parallel Implementation of Number-Theoretic Transform on GPU ClustersAlgorithms and Architectures for Parallel Processing10.1007/978-981-96-1542-1_12(204-218)Online publication date: 15-Feb-2025
https://doi.org/10.1007/978-981-96-1542-1_12
Gong YChang XMišić JMišić VWang JZhu H(2024)Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methodsCybersecurity10.1186/s42400-023-00187-47:1Online publication date: 1-Mar-2024
https://doi.org/10.1186/s42400-023-00187-4
de Souza Fde Lassus HCammarota R(2024)Private detection of relatives in forensic genomics using homomorphic encryptionBMC Medical Genomics10.1186/s12920-024-02037-917:1Online publication date: 19-Nov-2024
https://doi.org/10.1186/s12920-024-02037-9
Zhang JCheng XYang LHu JLiu XChen K(2024)SoK: Fully Homomorphic Encryption AcceleratorsACM Computing Surveys10.1145/367695556:12(1-32)Online publication date: 5-Jul-2024
https://dl.acm.org/doi/10.1145/3676955
Lyubashevsky VSeiler GSteuer PLuo BLiao XXu JKirda ELie D(2024)The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe PrivacyProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690330(3125-3137)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3690330
Yudha AXue JLou QZhou HSolihin Y(2024)BoostCom: Towards Efficient Universal Fully Homomorphic Encryption by Boosting the Word-wise ComparisonsProceedings of the 2024 International Conference on Parallel Architectures and Compilation Techniques10.1145/3656019.3676893(121-132)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3656019.3676893
Liu FLi YChen HJiao LLuo MWang M(2024)YuX: Finite Field Multiplication Based Block Ciphers for Efficient FHE EvaluationIEEE Transactions on Information Theory10.1109/TIT.2024.334941470:5(3729-3749)Online publication date: May-2024
https://doi.org/10.1109/TIT.2024.3349414
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten