격자 암호화를 위한 메모리 절약 방식의 정수 FFT

목차 (Table of Contents)

• 요약
• Abstract
• 1. 서론
• 2. 정수 FFT (NTT; Number Theoretic Transform)
• 3. Ring-LWE 암호화와 복호화
• 4. 메모리 절약 방식의 NTT
• 5. 성능 평가 및 결론
• 6. 감사의 글
• 7. 참고문헌

참고문헌 (Reference)

1 이병천, "키에스크로를 최소화한 계층적 아이디기반 암호" 보안공학연구지원센터 12 (12): 545-552, 2015

2 김연태, "속성기반암호화 기법을 이용한 안전한 메신저 시스템" 보안공학연구지원센터 12 (12): 469-486, 2015

3 Tsz-Wo Sze, "Schonhage-Strassen Algorithm with MapReduce for Multiplying Terabit Integers" 2011

4 Ray A. Perlner, "Quantum Resistant Public Key Cryptography: A Survey" 85-93, 2009

5 M. Ayinala, "Pipelined parallel FFT architectures via folding transformation" 20 (20): 1068-1081, 2012

6 Nigel P. Smart, "Fully homomorphic SIMD operations"

7 Wei Wang, "Exploring the Feasibility of Fully Homomorphic Encryption" 64 (64): 698-706, 2013

8 Rishiyur S. Nikhil, "Computer Architecture: A Constructive Approach, draft version"

9 S. S. Roy, "Compact Ring-LWE Cryptoprocessor" 8731 : 371-391, 2014

10 Jung Hee Cheon, "Batch Fully Homomorphic Encryption over the Integers" 7881 : 315-335, 2013

11 Gentry. C, "A fully homomorphic encryption scheme"

12 "1363 working group of the C/MSC committee, IEEE P1363.1 D12 Draft Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices"