CUDA Compatible GPU as an Efficient Hardware Accelerator for AES Cryptography
Abstract
This paper presents a study of the efficiency in applying modern graphics processing units in symmetric key cryptographic solutions. It describes both traditional style approaches based on the OpenGL graphics API and new ones based on the recent technology trends of major hardware vendors. It presents an efficient implementation of the advanced encryption standard (AES) algorithm in the novel CUDA platform by Nvidia. AES is currently the most widely adopted modern symmetric key encryption standard. The performance of the new fastest GPU solution is compared with those of the reference sequential implementations running on an Intel Pentium IV 3.0 GHz CPU. Unlike previous research in this field, the results of this effort show for the first time the GPU can perform as an efficient cryptographic accelerator. The developed solutions run up to 20 times faster than OpenSSL and in the same range of performance of existing hardware based implementations.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Hardware performance depends heavily on the capability of the memory architecture and the Arithmetic Logic Unit (ALU) to handle instructions without experiencing a bottleneck.
“kinerja ini sangat bergantung pada kemampuan arsitektur memori dan Arithmetic Logic Unit (ALU) dalam menangani instruksi tanpa mengalami kemacetan (bottleneck) [9]”
From Analisis Komparatif Kinerja Komputasi Brute Force pada Arsitektur GPU NVIDIA Turing, Ampere, dan Ada Lovelace (2026) · cites this paper as [9]
The standard GHASH algorithm is inherently sequential, making it ill-suited for the massive parallelism of GPUs.
“Consequently, the standard GHASH algorithm is inherently sequential, making it ill-suited for the massive parallelism of Graphics Processing Units (GPUs) (Manavski, 2007; Lee et al., 2025).”
From A high-throughput AES-GCM implementation on GPUs for secure, policy-based access to massive astronomical catalogs (2026) · cites this paper as Manavski, 2007
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 10 · Cited by 307
- Authors
- Manavski, S. A.
- Corresponding author
- Manavski, Svetlin A.
- Venue
- 2007 IEEE International Conference on Signal Processing and Communications
- Publisher
- IEEE
- Published
- 2007
- Pages
- 65-68
- OpenAlex
- W2536495848
- Cited by
- 307
- References
- 10
- Citations by year
- 2026: 5 · 2025: 5 · 2024: 2 · 2023: 6 · 2022: 9 · 2021: 12 · 2020: 11 · 2019: 20 · 2018: 15 · 2017: 13 · 2016: 21 · 2015: 20 · 2014: 20 · 2013: 28 · 2012: 38
- FWCI
- 11.05
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Signal Processing and Communications (SPCOM) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- AES, GPU acceleration, CUDA, symmetric encryption, OpenGL, CPU vs GPU performance comparison
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review