Fast AES Implementation: A High-Throughput Bitsliced Approach

Hajihassani, Omid; Monfared, Saleh Khalaj; Khasteh, Seyed Hossein; Gorgin, Saeid

doi:10.1109/tpds.2019.2911278

Cited by 37 publications

(15 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A feature of bitslice proposed by Kwan, is that it can efficiently parallelize bitwise operations [17]. This feature is often used to effectively implement cryptographic algorithms [18]- [20]. It is also used to process parallel S-boxes in mobile and embedded platforms because of its efficient parallel processing and constant operation speed [21], [22].…”

Section: Introductionmentioning

confidence: 99%

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

2022

View full text Add to dashboard Cite

The substitution box (S-box) is one of the major components of cryptographic algorithms. An important issue for cryptographic algorithm designers in ensuring sufficient security from linear cryptanalysis, one of the most powerful attacks, is finding an S-box with a sufficiently low linear spectrum. However, to the best of our knowledge, most of the published S-box analysis tools cannot generate linear approximation tables for large S-boxes, such as 16-bit S-boxes. Even tools that support the generation of 16-bit linear approximation tables using parallel processing, such as Eval16BitSbox, require a long time. We used bitslice, which can efficiently process bitwise operations in parallel by taking advantage of independent operations, for generating a linear approximation table. In this study, the linear approximation table generation method implemented using the element unit operation of the existing S-box was upgraded to a vector unit operation in a bitslice manner. This improved method enabled the immediate creation of tables, even for 16-bit Sboxes. This approach allows cryptographic algorithm designers to consider a wider variety of S-boxes. INDEX TERMS Large size S-box, Bitsliced implementation, Linear approximation Table21each round. When using an S-box for a nonlinear function, 22 this attack uses a difference distribution table (DDT) of the S-23 box. The DDT is a chart of how often a difference in the input 24 bit makes a difference in the output bit. Linear cryptanalysis 25 uses an equation generated by a linear approximation of 26 the relationship between the input and output bits of the S-27 box. Such an approximation can be achieved using a linear 28 approximation table (LAT) of the S-box. 29 Cryptanalysis largely utilizes these two tables. Finding an 30 S-box for which both properties are secure is therefore an 31 important issue for cryptographic algorithm designers. S-32 box analysis tools, such as PEIGEN, SAGE, SET, BSAT, 33 etc., generally provide facilities for the generation of DDT 34 and LAT [12]-[15]. However, as the bit size of the S-box 35 grows to around 16 bits, most tools do not support LAT 36 generation, or the generation process is not finished. In the 37 most widely used table generation method for an n-bit S-box, 38 2 2n computations are required to generate the DDT, and 2 3n 39 computations are required to generate the LAT. Hence, for

show abstract

Section: Introductionmentioning

confidence: 99%

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

2022

View full text Add to dashboard Cite

show abstract

“…Researches that optimize the AES encryption process on GPUs have still being studied. Recently, various optimization methods and results of AES using GPUs have been presented in [4], [5] and [6].…”

Section: Related Workmentioning

confidence: 99%

Designing a New XTS-AES Parallel Optimization Implementation Technique for Fast File Encryption

Seo

2022

IEEE Access

View full text Add to dashboard Cite

XTS-AES is a disk encryption mode of operation that uses the block cipher AES. Several studies have been conducted to improve the encryption speed using XTS-AES according to the increasing disk size. Among them, there are researches on parallel encryption of XTS-AES using GPU. Although these studies focus on parallel encryption of AES, optimization for the entire XTS mode has not been performed. The reason is that the α j computation process included in XTS mode is not suitable for parallel operation. Therefore, in this paper, we proposed several techniques for high-speed encryption in GPU by modifying XTS-AES into a form that is advantageous for parallel operation. The core idea is to pre-calculate the α j calculation on the CPU into a form that is easy to operate on the GPU. To achieve this goal, we analyzed the α j calculation process and present the parts that can be optimized. First, we presented a method that can replace multiple operations with a single table reference through the analyzed α j computation progress. Thereafter, we proposed a method that can be calculated by partially skipping the entire α j computation process that must be sequentially calculated through the table reference technique. For the proposed optimization implementation, we presented various results for evaluating the optimal implementation. In addition, we compared the performance of XTS-AES OpenSSL implementation on CPU and our proposed optimization implementation on GPU.

show abstract

“…In order to prevent the data in the packet from being cracked, the AES algorithm is chosen for encryption because it is faster and more secure than other encryption algorithms [24][25][26]. AES is a typical symmetric encryption algorithm for symmetric block encryption [27]. It is noticed that there are some AES-related encryption algorithms proposed recently, for example [28,29], which provides better performance for encrypting and transferring image data than for text data.…”

Section: Encryption Algorithmmentioning

confidence: 99%

A Two-Layer IP Hopping-Based Moving Target Defense Approach to Enhancing the Security of Mobile Ad-Hoc Networks

Wang

Zhou

Ding

2021

Sensors

View full text Add to dashboard Cite

Mobile ad-hoc networks (MANETs) have great potential applications in military missions or emergency rescue due to their no-infrastructure, self-organizing and multi hop capability characteristics. Obviously, it is important to implement a low-cost and efficient mechanism of anti-invasion, anti-eavesdropping and anti-attack in MANETs, especially for military scenarios. The purpose of intruding or attacking a MANET is usually different from that of wired Internet networks whose security mechanism has been widely explored and implemented. For MANETs, moving target defense (MTD) is a suitable mechanism to enhance the network security, whose basic idea is to continuously and randomly change the system parameters or configuration to create inaccessibility for intruders and attackers. In this paper, a two-layer IP hopping-based MTD approach is proposed, in which device IP addresses or virtual IP addresses change or hop according to the network security status and requirements. The proposed MTD scheme based on the two-layer IP hopping has two major advantages in terms of network security. First, the device IP address of each device is not exposed to the wireless physical channel at all. Second, the two-layer IP hops with individual interval and rules to obtain enhanced security of MANET while maintaining relatively low computational load and communication cost for network control and synchronization. The proposed MTD scheme is implemented in our developed MANET terminals, providing three level of network security: anti-intrusion in normal environment, intrusion detection in offensive environment and anti-eavesdropping in a hostile environment by combining the data encryption technology.

show abstract

Fast AES Implementation: A High-Throughput Bitsliced Approach

Cited by 37 publications

References 22 publications

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

Designing a New XTS-AES Parallel Optimization Implementation Technique for Fast File Encryption

A Two-Layer IP Hopping-Based Moving Target Defense Approach to Enhancing the Security of Mobile Ad-Hoc Networks

Contact Info

Product

Resources

About