.png){kind=icon}
返回
Efficient and Secure Implementation of NTRUEncrypt Using Signed Sliding Window Method
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3008182.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
NTRUEncrypt is a public key cryptosystem based on hard problems over lattices. The dominant operation in NTRUEncrypt is convolution, i.e., multiplication over a quotient ring of polynomials. Based on the fact that a convolution has a highly regular structure, Lee et al. proposed the sliding window method for fast convolution of binary polynomials in 2013, which was then extended to ternary polynomials for ideal lattices by Akleylek, Alkim, and Tok in 2016. These sliding window methods reduce the cost of a convolution operation using look-up tables that store partial computation results related to repeated coefficient patterns. In this paper, we propose a signed sliding window method with side-channel resistance for NTRUEncrypt. The proposed method considers both positive and negative nonzero coefficients when constructing look-up tables. The new method not only accelerates convolution but also enables the application of power analysis countermeasures effectively. According to the experimental results, the constant-time implementation of the proposed method with timing and power analysis countermeasures accelerates the previously developed secure convolution method by up to 20%.
Keyword:
Public key cryptography
side-channel attacks
NTRUEncrypt
sliding window method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Palladium-Catalyzed Arylation and Acylation of 1-Benzyloxy-1,2,3-triazole Through a Directed Ortho Lithiation-Transmetalation Strategy.png)
Synthesis
SynthesisIF0
PREAI
分享收藏
查看更多内容