In this paper NTRUEncrypt is implemented for the first time on a GPU using the CUDA platform. As is shown, this operation lends itself perfectly for parallelization and performs extremely well compared to similar security levels for ECC and RSA giving speedups of around three to five orders of magnitude. The focus is on achieving a high throughput, in this case performing a large number of encr...

In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ]  where 3  is a...

We present BAT – an IND-CCA secure key encapsulation mechanism (KEM) that is based on NTRU but follows encryption/decryption paradigm distinct from classical KEMs. It demonstrates a new approach of decrypting ciphertext since its introduction 25 years ago. Instead introducing artificial masking parameter p to decrypt the ciphertext, we use 2 linear equations in unknowns recover message and erro...

A multi-dimensional QTRU public-key cryptosystem improves NTRU by replacing the original ring in quaternion algebra. In this paper, we introduce QMNTR an improvement of using a new mathematical structure two public keys and five private keys. This modification has enhanced key system to be more robust secure.

Short Message Service (SMS) is getting more popular now-a-days. SMS was first used in December 1992, when Neil Papworth, a 22-year-old test engineer used a personal computer to send the text message "Merry Christmas" via the Vodafone GSM network to the phone of Richard Jarvis in the UK. It will play a very important role in the future business areas of mobile commerce (M-Commerce). Presently ma...

In this paper, the authors present a novel mutual authentication and key agreement protocol based on the Number Theory Research Unit (NTRU) public key cryptography. The symmetric encryption, hash and “challenge-response” techniques were adopted to build their protocol. To implement the mutual authentication and session key agreement, the proposed protocol contains two stages: namely initial pro...

Let h and g be polynomials of bounded Euclidean norm in the ring Z[X]/⟨X+1⟩. Given polynomial [h/g]q ∈ Zq[X]/⟨X+1⟩, the NTRU problem is to find a, b ∈ Z[X]/⟨X + 1⟩ with small Euclidean norm such that [a/b]q = [h/g]q. We propose an algorithm to solve the NTRU problem which runs in 2 2 q) time when ∥g∥, ∥h∥ and ∥g−1∥ are in some range. The main technique of our algorithm is to reduce a problem on...

In this work, we propose generic and novel side-channel assisted chosenciphertext attacks on NTRU-based key encapsulation mechanisms (KEMs). These KEMs are IND-CCA secure, that is, they secure in the chosen-ciphertext model. Our involve construction of malformed ciphertexts. When decapsulated by target device, these ciphertexts ensure a targeted intermediate variable becomes very closely relate...