1. Efficient Arithmetic For Lattice-Based Cryptography on Gpu Using the Cuda Platform
- Author
-
Sedat Akleylek, Zaliha Yüce Tok, and Ondokuz Mayıs Üniversitesi
- Subjects
Instruction set ,Signal processing ,Polynomial ,CUDA ,business.industry ,Computer science ,Lattice (order) ,Fast Fourier transform ,Multiplication ,Cryptography ,Parallel computing ,Lattice-based cryptography ,business - Abstract
22nd IEEE Signal Processing and Communications Applications Conference (SIU) -- APR 23-25, 2014 -- Karadeniz Teknik Univ, Trabzon, TURKEY Akleylek, Sedat/0000-0001-7005-6489 WOS: 000356351400193 The demand to lattice-based cryptographic schemes has been inreasing. Due to processing unit having multiple processors, there is a need to implements such protocols on these platforms. Graphical processing units (GPU) have attracted so much attention. In this paper, polynomial multiplication algorithms, having a very important role in lattice-based cryptographic schemes, are implemented on a GPU (NVIDIA Quadro 600) using the CUDA platform. FFT-based and schoolbook multiplication methods are implemented in serial and parallel way and a timing comparison for these techniques is given. It's concluded that for the polynomials whose degrees are up to 2000 the fastest polynomial multiplication method is iterative NTT. IEEE, Karadeniz Tech Univ, Dept Comp Engn & Elect & Elect Engn
- Published
- 2014