Fully homomorphic encryption (FHE) is a powerful scheme that allows computations to be performed on encrypted data. To reduce the computational complexity, double-CRT representation has been adopted in the BGV-FHE cryptosystem, in which the 2nd-CRT, also known as the polynomial-CRT, can be viewed as performing Discrete Fourier Transform (DFT). This paper explores efficient VLSI architecture of Bluestein’s FFT for BGV-FHE applications. The evaluation was conducted by implementing a Bluestein’s FFT compiler that can be configured to generate different point sizes of DFT designs for BGV-FHE.