GPU accelerated 3DES encryption

Download

ındex.pdf

Date

2021-07-01

Author

Altınok, Kaan Furkan
Peker, Afşin
Tezcan, Cihangir
Temizel, Alptekin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

217
views

144
downloads

Triple DES (3DES) is a NIST and ISO/IEC standard block cipher that is also used in some web browsers and several electronic payment applications. We propose an optimized bit-level parallelization of 3DES for GPU accelerated encryption to allow processing high volumes of data. Since the block size of 3DES is 64 bits, our approach considers a kernel block as a 64-bit 3DES block. Each kernel block performs XOR, permutation, and S-box operations of this cipher in parallel and memory accesses are optimized by the use of constant and shared memory. Although table based and bitsliced implementations of block ciphers on GPUs outperform naive implementations, their performance vary significantly on different GPU models and architectures. Lack of publicly available source codes prohibit a fair comparison of the performance results for different implementations. In this work, we provide performance results on various GPU models and make our implementation publicly available for reproducibility and further comparisons. When compared against the baseline multi-threaded CPU implementation, our optimization achieves an average of 15.95urn:x-wiley:cpe:media:cpe6507:cpe6507-math-0001 speed-up when encrypting large files using an RTX 2070 Super GPU. Moreover, when modified into a key search attack, more than 94.4 million 3DES key searches per second can be conducted on an RTX 2070 Super GPU.

URI

https://hdl.handle.net/11511/91393

Journal

Concurrency And Computation-Practice & Experience

DOI

https://doi.org/10.1002/cpe.6507

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

Infinite length hash chains and their applications Bicakci, K; Baykal, Nazife (2002-06-12) Hash Chains are used extensively in various cryptography, applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this chaining idea by using public-key techniques. One of its distinguishing features is that communication and computation overhead of restarting of the system is avoided. For the owner of the chain it is possible to go in either way in the chain at any time witho...
Design and analysis of hash functions Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009) Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...
Efficient Modular Exponentiation Methods for RSA Güner, Hatice; Cenk, Murat; Çalık, Çağdaş (2015-11-03) RSA is a commonly used asymmetric key cryptosystem that is used in encrypting and signing messages. The efficiency of the implementation is an important factor in effectively using the system. The RSA algorithm heavily depends on the modular exponentiation operation on large integers. A drawback of this system is that it becomes inefficient so quickly when the parameters are adjusted to increase security. This situation causes the operations to be performed with large numbers. Therefore, implementations req...
Performance analysis of elliptic curve multiplication algorithms for elliptic curve cryptography Özcan, Ayça Bahar; Yücel, Melek D; Department of Electrical and Electronics Engineering (2006) Elliptic curve cryptography (ECC) has been introduced as a public-key cryptosystem, which offers smaller key sizes than the other known public-key systems at equivalent security level. The key size advantage of ECC provides faster computations, less memory consumption, less processing power and efficient bandwidth usage. These properties make ECC attractive especially for the next generation public-key cryptosystems. The implementation of ECC involves so many arithmetic operations; one of them is the ellipt...
Efficient multivariate-based ring signature schemes Demircioğlu, Murat; Cenk, Murat; Akleylek, Sedat; Department of Cryptography (2022-8-4) The ring signature scheme has a wide range of usage areas in public-key cryptography. One is leaking information within a group without exposing the signer's identity. The majority of the ring signature techniques in use, on the other hand, rely on classical crypto-systems such as RSA and ECDH, which are known to be vulnerable to Shor's algorithm on a large-scale quantum computer. In this thesis, we propose efficient quantum-resistant ring signature schemes based on GeMSS and Gui signature algorithms. Gui w...

Citation Formats

K. F. Altınok, A. Peker, C. Tezcan, and A. Temizel, “GPU accelerated 3DES encryption,” Concurrency And Computation-Practice & Experience, pp. 1–14, 2021, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/91393.