Memory Saving Architecture of Number Theoretic Transform for Lattice Cryptography
| Autor: | Sangook Moon |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Theoretical computer science
General Computer Science business.industry Computer science Modulo Homomorphic encryption 020207 software engineering Cryptography 02 engineering and technology Encryption 020202 computer hardware & architecture Microarchitecture Computer Science::Hardware Architecture symbols.namesake Fourier transform Integer 0202 electrical engineering electronic engineering information engineering symbols Lattice-based cryptography Arithmetic business |
| Zdroj: | International Journal of Security and Its Applications. 10:9-18 |
| ISSN: | 1738-9976 |
| Popis: | In realizing a homomorphic encryption system, the operations of 1encrypt, decrypt, and recrypt constitute major portions. The most important common operation for each back-bone operations include a polynomial modulo multiplication for over million-bit integers, which can be obtained by performing integer Fourier transform, also known as number theoretic transform. In this paper, we adopt and modify an algorithm for calculating big integer multiplications introduced by Schonhage-Strassen to propose an efficient Ring-LWE processor architecture which can save memory. The proposed architecture of Ring-LWE encryption processor has been implemented on an FPGA and evaluated. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|