Beka Barbakadze 3cd48f0de2 feat(cuda): add a new fft algorithm. ...

- FFT can work for any polynomial size, as long as twiddles are provided.
 - All the twiddles fit in the constant memory.
 - Bit reverse is not used anymore, no more sw1 and sw2 arrays in constant memory.
 - Real to complex compression algorithm is changed.
 - Twiddle initialization functions are removed.

2023-02-08 00:49:44 +04:00

..

boolean_gates.h

feat(cuda): add missing boolan gates

2023-01-25 09:30:50 +01:00

bootstrap.h

feat(cuda): add a new fft algorithm.

2023-02-08 00:49:44 +04:00

device.h

fix(cuda): fix asynchronous behaviour for pbs and wop pbs

2023-01-28 14:20:34 +01:00

helper_cuda.h

feat(cuda): introduce cuda acceleration for the pbs and keyswitch

2022-06-27 09:10:20 +02:00

helper_debug.cuh

feat(cuda): introduce cuda acceleration for the pbs and keyswitch

2022-06-27 09:10:20 +02:00

helper_string.h

feat(cuda): introduce cuda acceleration for the pbs and keyswitch

2022-06-27 09:10:20 +02:00

keyswitch.h

fix(cuda): fix asynchronous behaviour for pbs and wop pbs

2023-01-28 14:20:34 +01:00

linear_algebra.h

feat(cuda): add lwe / cleartext multiplication GPU acceleration

2022-11-09 15:31:36 +01:00