Secure number theoretic transform and speed record for ring-LWE encryption on embedded processors
- 문서 유형
- 연구출판물 · 학술대회 발표논문
- 등재
- Scopus
- 저널 순위
- Scopus Q2
- 저널
- Lecture Notes in Computer Science10779 LNCS · pp.175 · 2018
- 피인용
- Scopus 7
- FWCI (Scopus)
- 0.72
- ISSN
- 0302-9743
저자
- 서화정제1저자Department of IT, Hansung University, Seoul, South Korea
- Liu, ZheAPSIA, Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg
- 박태환School of Computer Science and Engineering, Pusan National University, Busan, South Korea
- Kwon, HyeokchanSystem Security Research Group, Electronics and Telecommunciations Research Institute, Daejeon, South Korea
- Lee, SokjoonSystem Security Research Group, Electronics and Telecommunciations Research Institute, Daejeon, South Korea
- 김호원교신저자School of Computer Science and Engineering, Pusan National University, Busan, South Korea
초록
Compact implementations of the ring variant of the Learning with Errors (Ring-LWE) on the embedded processors have been actively studied due to potential quantum threats. Various Ring-LWE implementation works mainly focused on optimization techniques to reduce the execution timing and memory consumptions for high availability. For this reason, they failed to provide secure implementations against general side channel attacks, such as timing attack. In this paper, we present secure and fastest Ring-LWE encryption implementation on low-end 8-bit AVR processors. We targeted the most expensive operation, i.e. Number Theoretic Transform (NTT) based polynomial multiplication, to provide countermeasures against timing attacks and best performance among similar implementations till now. Our contributions for optimizations are concluded as follows: (1) we propose the Look-Up Table (LUT) based fast reduction techniques for speeding up the modular coefficient multiplication in regular fashion, (2) we use the modular addition and subtraction operations, which are performed in constant timing. With these optimization techniques, the proposed NTT implementation enhances the performance by 18.3–22% than previous works. Finally, our Ring-LWE encryption implementations require only 680,796 and 1,754,064 clock cycles for 128-bit and 256-bit security levels, respectively.
키워드
8-bit AVRDiscrete gaussian samplingNumber theoretic transformPublic key encryptionRing learning with errorsSoftware implementationTiming attack
식별자
- Scopus EID
- 2-s2.0-85044477454



로그인
연구물 목록으로