Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption

DOI10.1109/TC.2015.2498606MaRDI QIDQ2985293zbMATH OpenOpenAlexWikidataFDO

Authors Xiaolin Cao, Ciara Moore, Máire O'Neill, Elizabeth O'Sullivan, Neil Hanley

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2015.2498606

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited in

(5)

• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
• Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
• Accelerating homomorphic evaluation on reconfigurable hardware
• Faster homomorphic encryption over GPGPUs via hierarchical DGT
• Discretization error reduction for high precision torus fully homomorphic encryption

This page was built for publication: Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985293)