Earticle

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Lattice Cryptography
 3. Fully Homomorphic Encryption
  3.1. Key Setting
  3.2. Encryption Stage
  3.3. Decryption Stage
 4. Number Theoretic Transform
 5. Gaussian Sampler
 6. Ring-LWE Encryption and Decryption
 7. Memory-Saving Number Theoretic Transform
 8. Conclusion
 Acknowledgments
 References

키워드

저자

• Sangook Moon [ Mokwon University, 88 Doan North Road, 302-729 Daejeon, Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605