Skip to content

Portable Acceleration of Learning With Errors KEMs for Post-Quantum Cryptography

Jul 2026 · arXiv.org · Vol abs/2607.09541 · 0 citations · 14 references
Computer Science

TL;DR

It is demonstrated that portable GPU acceleration can significantly reduce the computational overhead of PQC while avoiding vendor lock in, thereby facilitating the deployment of quantum resistant cryptographic infrastructures.

Abstract

The transition to post-quantum cryptography (PQC) is driving demand for implementations that can meet the computational requirements of real-world applications. Among the proposed PQC constructions, Learning With Errors (LWE) based key encapsulation mechanisms (KEMs) are particularly attractive due to their strong security foundations, but they incur substantial computational costs from matrix operations and large-scale cryptographically secure random number generation. These characteristics position GPU acceleration as an effective approach for lowering the computational overhead of lattice based cryptographic schemes. In this work, we present a portable GPU implementation of a plain LWE based KEM using OpenMP Target offloading. Unlike most existing GPU implementations, which rely on CUDA specific optimizations, our approach uses a single source code base that executes on both NVIDIA and AMD accelerators. We evaluate the proposed implementation on different accelerator architectures, analyzing performance benchmarking, runtime profiling, scalability analysis, and energy to solution measurements. Experimental results show that OpenMP Target offloading delivers substantial acceleration over a multicore CPU baseline while preserving source level portability across heterogeneous GPU ecosystems. Cross platform analysis identifies NVIDIA GH200 and AMD MI300X as the most effective platforms for this memory bound workload, while profiling indicates that memory system organization and CPU GPU interaction play a more critical role than peak compute capability alone. These findings demonstrate that portable GPU acceleration can significantly reduce the computational overhead of PQC while avoiding vendor lock in, thereby facilitating the deployment of quantum resistant cryptographic infrastructures.

View source

Similar papers

Preprint Sep 2026

Benchmarking Post-Quantum Cryptography in Lightweight Virtualization Environments on Embedded Hardware

A measurement study of PQC primitives on embedded-class ARM hardware under three execution environments with a shared software stack: native execution, a Docker container, and a Unikraft unikernel running under QEMU finds that container overhead is negligible for primitive computation, whereas unikernel overhead depend...

Nikolai Puch, C. Ta, Moritz Beckel · 0 citations
Conference Aug 2026

Python-based Quantum Circuit Testbed for Arithmetic and Logic Operations

With the exponentially increasing global data volumes it is challenging to meet the ultra-low latency requirements of the next-generation sophisticated applications using the existing computing resources. Though multiple existing methods and approaches such as edge-and-cloud computing, high performance computing (HPC),...

Daniel C. Colon-Rivera, Juan D. Guadalupe-Rosado, Venkataramani Kumar et al. · 0 citations
Open access Sep 2026

High-Throughput GPU Design and Implementation of MAYO with Matrix Computation Reordering

This work presents the first high-throughput GPU implementation and evaluation of MAYO, covering Keygen, Signing, and Verification, and introduces a data reuse-aware computation model for matrix-dominated and memory-access-bound workloads, and proposes Reuse Matrix Multiplication Evaluation (RMME) to reduce redundant g...

Hao-Yang Chen, Jun-Hao Huang, Shu-Tong Jin et al. · 0 citations
Aug 2026

Implementation and Evaluation of Quantum-Vulnerable and Quantum-Safe Cryptographic Algorithms

This work develops and executes a practical benchmarking framework that compares classical RSA and simulated post-quantum cryptographic algorithms, and provides a concrete, implementable model for evaluating post-quantum cryptography under realistic computational conditions.

Rakesh Singh T., Hemalatha Eedi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.