Improving BDD Enumeration for LWE Problem Using GPU
In this paper, we present a GPU-based parallel algorithm for the Learning With Errors (LWE) problem using a lattice-based Bounded Distance Decoding (BDD) approach. To the best of our knowledge, this is the first GPU-based implementation for the LWE problem. Compared to the sequential BDD implementat...
Main Authors: | Mohamed S. Esseissah, Ashraf Bhery, Hatem M. Bahig |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8937542/ |
Similar Items
-
An Efficient Algorithm for the Shortest Vector Problem
by: Yu-Lun Chuang, et al.
Published: (2018-01-01) -
A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem
by: Zedong Sun, et al.
Published: (2020-01-01) -
Analysis of the Extended Search Space for the Shortest Vector in Lattice
by: Masaharu Fukase, et al.
Published: (2011-12-01) -
Low Complexity Coefficient Selection Algorithms for Compute-and-Forward
by: Qinhui Huang, et al.
Published: (2017-01-01) -
Efficient MIMO Preprocessor With Sorting-Relaxed QR Decomposition and Modified Greedy LLL Algorithm
by: Lirui Chen, et al.
Published: (2020-01-01)