PARALLEL AND RUNTIME RECONFIGURABLE IMPLEMENTATION OF THE IDEA ALGORITHM

2009 ◽  
Vol 18 (01) ◽  
pp. 133-150 ◽  
Author(s):  
JOSÉ MARÍA GRANADO-CRIADO ◽  
MIGUEL ÁNGEL VEGA-RODRÍGUEZ ◽  
JUAN MANUEL SÁNCHEZ-PÉREZ ◽  
JUAN ANTONIO GÓMEZ-PULIDO
Keyword(s):  
Parallel Implementation ◽  
Dynamic Reconfiguration ◽  
Good Choice ◽  
Information Networks ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Hardware Performance ◽  
A Performance

Cryptographic algorithms are a fundamental tool nowadays, and information networks continue to grow exponentially every year. Moreover, these algorithms need to be very fast due to the new standards. In order to achieve this characteristic, a good choice is to use FPGAs, which mix the advantages of software flexibility and hardware performance. In this work, we present a super-pipelined and parallel implementation of the IDEA cryptographic algorithm by using partial and dynamic reconfiguration. Our implementation reaches a performance of 26.028 Gb/s, and therefore, it obtains better results than those found in the literature.

A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion

2020 ◽  
Vol 13 (3) ◽  
pp. 435-445 ◽  
Author(s):  
Malik Qasaimeh ◽  
Raad S. Al-Qassas ◽  
Fida Mohammad ◽  
Shadi Aljawarneh
Keyword(s):  
Processing Time ◽  
Block Size ◽  
Statistical Test ◽  
Mathematical Proofs ◽  
The Past ◽  
Aes Algorithm ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Compare And Contrast ◽  
Constrained Devices

Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.

scholarly journals A PETSc-Based Parallel Implementation of Finite Element Method for Elasticity Problems

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Jianfei Zhang
Keyword(s):  
Finite Element Method ◽  
Finite Element ◽  
Parallel Implementation ◽  
Good Choice ◽  
Finite Element Code ◽  
Finite Element Discretization ◽  
Element Analysis ◽  
Element Discretization ◽  
Elasticity Problems ◽  
Parallel Code

Starting a parallel code from scratch is not a good choice for parallel programming finite element analysis of elasticity problems because we cannot make full use of our existing serial code and the programming work is painful for developers. PETSc provides libraries for various numerical methods that can give us more flexibility in migrating our serial application code to a parallel implementation. We present the approach to parallelize the existing finite element code within the PETSc framework. Our approach permits users to easily implement the formation and solution of linear system arising from finite element discretization of elasticity problem. The main PETSc subroutines are given for the main parallelization step and the corresponding code fragments are listed. Cantilever examples are used to validate the code and test the performance.

scholarly journals Efficient Parallel Implementation of CTR Mode of ARX-Based Block Ciphers on ARMv8 Microcontrollers

2021 ◽  
Vol 11 (6) ◽  
pp. 2548
Author(s):  
JinGyo Song ◽  
Seog Chung Seo
Keyword(s):  
High Speed ◽  
Parallel Implementation ◽  
Optimization Technique ◽  
Block Ciphers ◽  
Processing Technique ◽  
Industrial Applications ◽  
Mobile Telecommunication ◽  
Cryptographic Algorithms ◽  
Improved Performance ◽  
Iot Devices

With the advancement of 5G mobile telecommunication, various IoT (Internet of Things) devices communicate massive amounts of data by being connected to wireless networks. Since this wireless communication is vulnerable to hackers via data leakage during communication, the transmitted data should be encrypted through block ciphers to protect the data during communication. In addition, in order to encrypt the massive amounts of data securely, it is essential to apply one of secure mode of operation. Among them, CTR (CounTeR) mode is the most widely used in industrial applications. However, these IoT devices have limited resources of computing and memory compared to typical computers, so that it is challenging to process cryptographic algorithms that have computation-intensive tasks in IoT devices at high speed. Thus, it is required that cryptographic algorithms are optimized in IoT devices. In other words, optimizing cryptographic operations on these IoT devices is not only basic but also an essential effort in order to build secure IoT-based service systems. For efficient encryption on IoT devices, even though several ARX (Add-Rotate-XOR)-based ciphers have been proposed, it still necessary to improve the performance of encryption for smooth and secure IoT services. In this article, we propose the first parallel implementations of CTR mode of ARX-based ciphers: LEA (Lightweight Encryption Algorithm), HIGHT (high security and light weight), and revised CHAM on the ARMv8 platform, a popular microcontroller in various IoT applications. For the parallel implementation, we propose an efficient data parallelism technique and register scheduling, which maximizes the usage of vector registers. Through proposed techniques, we process the maximum amount of encryption simultaneously by utilizing all vector registers. Namely, in the case of HIGHT and revised CHAM-64/128 (resp. LEA, revised CHAM-128/128, and CHAM-128/256), we can execute 48 (resp. 24) encryptions simultaneously. In addition, we optimize the process of CTR mode by pre-computing and using the intermediate value of some initial rounds by utilizing the property that the nonce part of CTR mode input is fixed during encryptions. Through the pre-computation table, CTR mode is optimized up until round 4 in LEA, round 5 in HIGHT, and round 7 in revised CHAM. With the proposed parallel processing technique, our software provides 3.09%, 5.26%, and 9.52% of improved performance in LEA, HIGHT, and revised CHAM-64/128, respectively, compared to the existing parallel works in ARM-based MCU. Furthermore, with the proposed CTR mode optimization technique, our software provides the most improved performance with 8.76%, 8.62%, and 15.87% in LEA-CTR, HIGHT-CTR, and revised CHAM-CTR, respectively. This work is the fastest implementation of CTR mode on ARMv8 architecture to the best of our knowledge.

scholarly journals Properties of the Rainbow multi-variant algorithm and its ability to resist various crypto-analysis methods and attack by outside channels

Radiotekhnika ◽  
2021 ◽  
pp. 79-84
Author(s):  
D.V. Harmash
Keyword(s):  
Multilayer Structure ◽  
Point Of View ◽  
Third Party ◽  
Electronic Signature ◽  
Mathematical Point ◽  
Analysis Methods ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms

This work presents the analysis of the essence and possibilities of protection of the Rainbow post-quantum cryptographic algorithm. The main properties of the Rainbow algorithm and the general essence of cryptographic encryption and electronic signature algorithms based on multivariate quadratic transformations are determined. The main provisions regarding the protocols are given. Analyses are given regarding the ability to protect the algorithm against various attacks. The vulnerability of the algorithm to attack by third-party channels is investigated. The general provisions of the algorithm are considered. The algorithm is presented and considered from a mathematical point of view, as well as the mathematical essence of cryptographic algorithms for encryption and electronic signature based on multivariate quadratic transformations. The application of various methods of cryptanalysis against cryptographic algorithm based on multivariate quadratic Rainbow transformations is studied. The method of decreasing rank against the Rainbow algorithm is analyzed. The method of cryptanalysis by attacking the Oil-Vinegar scheme and the method of cryptanalysis "minranku method" are investigated. The attack is studied using a multilayer structure.

scholarly journals Lightweight Security Architecture for Iot Device Communication

2019 ◽  
Vol 9 (2) ◽  
pp. 2980-2983
Keyword(s):  
Time Complexity ◽  
Secure Communication ◽  
Human Life ◽  
Energy Resources ◽  
Security And Privacy ◽  
Security Architecture ◽  
Light Weight ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Iot Devices

Internet of Things (IoT) becomes part of our daily life. IoT has greatly uplifted the human life and has touched many aspect in our life style. IoT devices are sophisticated lowend device having limited computational and energy resources. Most of the cryptographic algorithms are based on complex mathematical calculation which is not feasible to be computed on IoT devices. Hence presently IoT devices lack strong security features. Security and privacy are becoming the real concern for IoT devices. In this paper we are exploring the various cryptographic algorithm which can be used for IoT device authentication and secure communication. The overall system is designed considering the light weight factor, scalability, time complexity and ease of implementation

scholarly journals A Secure White Box Implementation of AES Against First Order DCA

2019 ◽  
Author(s):  
Ana Clara Serpa ◽  
Giuliano Sider ◽  
Hayato Fujii ◽  
Félix Rodrigues ◽  
Ricardo Dahab ◽  
...  
Keyword(s):  
Experimental Results ◽  
Side Channel ◽  
Performance Difference ◽  
First Order ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Execution Environment ◽  
Computation Analysis ◽  
Complete Access ◽  
Secure Implementation

The white box threat model considers an attacker with complete access to the implementation and execution environment of a cryptographic algorithm. Aiming towards secure implementation of cryptographic algorithms in this context, several implementations of the AES cipher were proposed in the literature. However, they were proven vulnerable to implementation specific attacks, as well as to refined side-channel and more robust attacks that do not rely on implementation knowledge of the cipher, such as DCA (differential computation analysis). In this paper we present a white box implementation of the AES cipher with recently proposed DCA countermeasures [Lee et al. 2018]. We provide a comparison of the performance difference these countermeasures incur in practice and report some preliminary experimental results on the security of our implementation.

scholarly journals Penerapan Algoritma CAST-128 pada Proses Enkripsi dan Dekripsi Teks

2020 ◽  
Vol 2 (1) ◽  
pp. 16-24
Author(s):  
Yessi Sriani Barus ◽  
Abdul Sani Sembiring
Keyword(s):  
Block Length ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms

Encoding was first made using a classic algorithm. This algorithm builds its security on the confidentiality of the algorithm used. However, this algorithm is inefficient when used to communicate with many people because the algorithm is still very simple and still very easy to solve, so important information or data that you want to keep secret can be easily discovered by other people or people who are not responsible. CAST-128 is a cryptographic algorithm that is said to be similar to the DES algorithm which uses 16 rounds of feistel network as one of its strengths. Where in the process of encryption and decryption of text CAST-128 uses a 64-bit block length and key lengths of up to 128 bits. For information, the CAST-128 algorithm is referred to as one of the strong cryptographic algorithms against various types of cryptanalysis, including differential and linear attacks. With the application of the CAST-128 algorithm in the process of encrypting and decrypting text, it will be more difficult to decode text encoded by people who do not know the key so as to create more security than the encoded text. So when the text wants to be sent or transferred to the flashdisk will be more confidential.

scholarly journals Development of the Advanced Encryption Standard

2021 ◽  
Vol 126 ◽  
Author(s):  
Miles E. Smid
Keyword(s):  
Information Processing ◽  
Computer Security ◽  
Academic Community ◽  
Advanced Encryption Standard ◽  
Security Technology ◽  
Cryptographic Algorithm ◽  
The World ◽  
Cryptographic Algorithms ◽  
Technology Group ◽  
The U.S

Strong cryptographic algorithms are essential for the protection of stored and transmitted data throughout the world. This publication discusses the development of Federal Information Processing Standards Publication (FIPS) 197, which specifies a cryptographic algorithm known as the Advanced Encryption Standard (AES). The AES was the result of a cooperative multiyear effort involving the U.S. government, industry, and the academic community. Several difficult problems that had to be resolved during the standard’s development are discussed, and the eventual solutions are presented. The author writes from his viewpoint as former leader of the Security Technology Group and later as acting director of the Computer Security Division at the National Institute of Standards and Technology, where he was responsible for the AES development.

Sign in / Sign up

Export Citation Format

Share Document