2016/11/27 by Thomas Shortell, Shortell, Thomas, Ali Shokoufandeh +1
Computer Science · #Chaos-based Image/Signal Encryption #Cryptographic Implementations and Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1611.08769
openalex publication_date 2016/11/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Secure signal processing is becoming a de facto model for preserving privacy. We propose a model based on the Fully Homomorphic Encryption (FHE) technique to mitigate security breaches. Our framework provides a method to perform a Fast Fourier Transform (FFT) on a user-specified signal. Using encryption of individual binary values and FHE operations over addition and multiplication, we enable a user to perform the FFT in a fixed point fractional representation in binary. Our approach bounds the error of the implementation to enable user-selectable parameters based on the specific application. We verified our framework against test cases for one dimensional signals and images (two dimensional signals).