Faster Homomorphic Evaluation of Discrete Fourier Transforms

DOI10.1007/978-3-319-70972-7_29zbMath1460.94042OpenAlexW2578913585MaRDI QIDQ5854442

Srinivas Vivek, Anamaria Costache, Nigel P. Smart

Publication date: 17 March 2021

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: http://eprint.iacr.org/2016/1019

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (5)

When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Efficiently processing complex-valued data in homomorphic encryption ⋮ A full RNS variant of approximate homomorphic encryption

Cites Work

• Factoring polynomials with rational coefficients
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Evaluation of the AES Circuit
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

This page was built for publication: Faster Homomorphic Evaluation of Discrete Fourier Transforms