Computational Aspects of Lattice-Based Cryptography on Graphical Processing Unit

View Sample PDF

Author(s): Sedat Akleylek (Ondokuz Mayis University, Turkey)and Zaliha Yuce Tok (Middle East Technical University, Turkey)
Copyright: 2016
Pages: 30
Source title: Improving Information Security Practices through Computational Intelligence
Source Author(s)/Editor(s): Wasan Awad (Ahlia University, Bahrain), El Sayed M. El-Alfy (King Fahd University of Petroleum and Minerals, Saudi Arabia)and Yousif Al-Bastaki (University of Bahrain, Bahrain)
DOI: 10.4018/978-1-4666-9426-2.ch010

Keywords: Artificial Intelligence / Computer Science & IT / Information Science Reference / IT Security and Ethics

Purchase

View Computational Aspects of Lattice-Based Cryptography on Graphical Processing Unit on the publisher's website for pricing and purchasing information.

Abstract

In this chapter, the aim is to discuss computational aspects of lattice-based cryptographic schemes focused on NTRU in view of the time complexity on a graphical processing unit (GPU). Polynomial multiplication algorithms, having a very important role in lattice-based cryptographic schemes, are implemented on the GPU using the compute unified device architecture (CUDA) platform. They are implemented in both serial and parallel way. Compact and efficient implementation architectures of polynomial multiplication for lattice-based cryptographic schemes are presented for the quotient ring both Zp [x]/(xn-1) and Zp [x]/(xn+1), where p is a prime number. Then, by using these implementations the NTRUEncrypt and signature scheme working over Zp [x]/(xn+1) are implemented on the GPU using CUDA platform. Implementation details are also discussed.

The IRMA Community

Research IRM

Computational Aspects of Lattice-Based Cryptography on Graphical Processing Unit

Purchase

Abstract

Related Content

IRMA Sponsors