Name
Abstract | ||
|---|---|---|
NTRU is a public key cryptosystem based on hard problems over lattices. In this paper, we present efficient methods for convolution product computation which is a dominant operation of NTRU. The new methods are based on the observation that repeating patterns in coefficients of an NTRU polynomial can be used for the construction of look-up tables, which is a similar approach to the sliding window methods for exponentiation. We provide efficient convolution algorithms to implement this idea, and we make a comprehensive analysis of the complexity of the new algorithms. We also give software implementations over a Pentium IV CPU, a MICAz mote, and a CUDA-based GPGPU platform. 'According to our analyses and experimental results, the new algorithms speed up the NTRU encryption and decryption operations by up to 41%. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1587/transfun.E96.A.206 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
data encryption, public key cryptosystems, NTRU, convolution product, sliding window method | Journal | E96A |
Issue | ISSN | Citations |
1 | 0916-8508 | 3 |
PageRank | References | Authors |
0.60 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mun-Kyu Lee | 1 | 113 | 17.80 |
| Jung Woo Kim | 2 | 32 | 4.26 |
| Jeong Eun Song | 3 | 24 | 2.78 |
| Kunsoo Park | 4 | 1396 | 171.00 |