ORSCA-GPU: one round stream cipher algorithm for GPU implementation

Abstract

Data confidentiality is one of the most critical security services. Many encryption algorithms are currently used to provide data confidentiality. That is why there are continuous research efforts on the design and implementation of efficient cipher schemes. For this purpose, different lightweight cipher algorithms have been presented and implemented on GPUs with different optimizations to reach high performance. Some examples of these ciphers are Speck, Simon which both require less latency compared to Advanced Encryption Standard (AES). However, these solutions require a higher number of rounds but with a more simple round function compared to AES. Therefore, in this paper, a new cipher scheme called "ORSCA" is defined which only requires one round with the dynamic key-dependent approach. The proposed cipher is designed according to the GPU characteristics. The proposed one-round stream cipher solution is suitable for the high data rate applications. According to the performance results, it can achieve high data throughput compared to existing ones, with throughput greater than 5 Terabits/s on a Tesla A100 GPU. Thus, this approach can be considered as a promising candidate for real-time applications. Finally, the security level is ensured by using the dynamic cryptographic primitives that can be changed for each new input message (or for a set of messages: sub-session key). Thus, the proposed solution is a promising candidate for high secure GPU cryptographic algorithms.Keywords-One round GPU stream cipher solution; Security and performance analysis; Parallel computing; Dynamic key dependent cryptographic primitives confidentiality, while active attacks can compromise the data authentication, integrity, and availability. Active attackers have the ability to insert, remove, and alter the data content, while passive attackers just intercept the communicated data. Passive attacks are more difficult to detect but they should be taking into account to preserve the data confidentiality.

A Survey of Parallel Message Authentication and Hashing Methods

“…the ability to insert, edit, or remove data content. Passive attacks are the sort of attacks in which the attacker reads or a copy of a message's content, jeopardizing their confidentiality [3] . The system is not affected as a result of the passive attack.…”

“…Many researchers, however, used the authentication algorithm to obtain the MAC value faster by applying them algorithm on parallel. Thus, table (3) demonstrates the comparison between the existing parallel authentication methods. The table uses star symbol to represent the level of each factor, more stars is the best.…”

Parallel Message Authentication Algorithm Implemented Over Multicore CPU

“…Randomness and uniformity are two criteria necessary authentication and encryption against statistical attacks. The following statistical integrity tests are carried out to evaluate the level of randomness, analysis of the PDF, histogram, entropy, and the correlation of the original and encrypted messages [15].…”

“…Both the one round cipher and the proposed authentication algorithm were put to the test with 1000 seeds using Practrand [15], and they passed every test with flying colures. This was noted above.…”

“…To make sure the suggested encryption system is secure, it is crucial to get rid of any connection between the sequences of the components [15]. When the correlation coefficient is small (very close to zero), it indicates that the cipher scheme is quite random.…”