Data encryption and decryption are common operations in network-based application programs that must offer security. In order to keep pace with the high data input rate of network-based applications such as the multimedia data streaming, real-time processing of the data encryption/decryption is crucial. In this paper, we propose a new parallelization approach to improve the throughput performance for the de-facto standard data encryption and decryption algorithm, AES-CTR (Counter mode of AES). The new approach extends the size of the block encrypted at one time across the unit block boundaries, thus effectively encrypting multiple unit blocks at the same time. This reduces the associated parallelization overheads such as the number of procedure calls, the scheduling and the synchronizations compared with previous approaches. Therefore, this leads to significant throughput performance improvements on a computing platform with a general-purpose multi-core processor and a Graphic Processing Unit (GPU).
Nhat-Phuong TRAN
Myongji University
Myungho LEE
Myongji University
Sugwon HONG
Myongji University
Seung-Jae LEE
Myongji University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Nhat-Phuong TRAN, Myungho LEE, Sugwon HONG, Seung-Jae LEE, "High Throughput Parallelization of AES-CTR Algorithm" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 8, pp. 1685-1695, August 2013, doi: 10.1587/transinf.E96.D.1685.
Abstract: Data encryption and decryption are common operations in network-based application programs that must offer security. In order to keep pace with the high data input rate of network-based applications such as the multimedia data streaming, real-time processing of the data encryption/decryption is crucial. In this paper, we propose a new parallelization approach to improve the throughput performance for the de-facto standard data encryption and decryption algorithm, AES-CTR (Counter mode of AES). The new approach extends the size of the block encrypted at one time across the unit block boundaries, thus effectively encrypting multiple unit blocks at the same time. This reduces the associated parallelization overheads such as the number of procedure calls, the scheduling and the synchronizations compared with previous approaches. Therefore, this leads to significant throughput performance improvements on a computing platform with a general-purpose multi-core processor and a Graphic Processing Unit (GPU).
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.E96.D.1685/_p
Copy
@ARTICLE{e96-d_8_1685,
author={Nhat-Phuong TRAN, Myungho LEE, Sugwon HONG, Seung-Jae LEE, },
journal={IEICE TRANSACTIONS on Information},
title={High Throughput Parallelization of AES-CTR Algorithm},
year={2013},
volume={E96-D},
number={8},
pages={1685-1695},
abstract={Data encryption and decryption are common operations in network-based application programs that must offer security. In order to keep pace with the high data input rate of network-based applications such as the multimedia data streaming, real-time processing of the data encryption/decryption is crucial. In this paper, we propose a new parallelization approach to improve the throughput performance for the de-facto standard data encryption and decryption algorithm, AES-CTR (Counter mode of AES). The new approach extends the size of the block encrypted at one time across the unit block boundaries, thus effectively encrypting multiple unit blocks at the same time. This reduces the associated parallelization overheads such as the number of procedure calls, the scheduling and the synchronizations compared with previous approaches. Therefore, this leads to significant throughput performance improvements on a computing platform with a general-purpose multi-core processor and a Graphic Processing Unit (GPU).},
keywords={},
doi={10.1587/transinf.E96.D.1685},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - High Throughput Parallelization of AES-CTR Algorithm
T2 - IEICE TRANSACTIONS on Information
SP - 1685
EP - 1695
AU - Nhat-Phuong TRAN
AU - Myungho LEE
AU - Sugwon HONG
AU - Seung-Jae LEE
PY - 2013
DO - 10.1587/transinf.E96.D.1685
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2013
AB - Data encryption and decryption are common operations in network-based application programs that must offer security. In order to keep pace with the high data input rate of network-based applications such as the multimedia data streaming, real-time processing of the data encryption/decryption is crucial. In this paper, we propose a new parallelization approach to improve the throughput performance for the de-facto standard data encryption and decryption algorithm, AES-CTR (Counter mode of AES). The new approach extends the size of the block encrypted at one time across the unit block boundaries, thus effectively encrypting multiple unit blocks at the same time. This reduces the associated parallelization overheads such as the number of procedure calls, the scheduling and the synchronizations compared with previous approaches. Therefore, this leads to significant throughput performance improvements on a computing platform with a general-purpose multi-core processor and a Graphic Processing Unit (GPU).
ER -