Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

An efficient permutation approach for SbPN-based symmetric block ciphers

View through CrossRef
Abstract It is challenging to devise lightweight cryptographic primitives efficient in both hardware and software that can provide an optimum level of security to diverse Internet of Things applications running on low-end constrained devices. Therefore, an efficient hardware design approach that requires some specific hardware resource may not be efficient if implemented in software. Substitution bit Permutation Network based ciphers such as PRESENT and GIFT are efficient, lightweight cryptographic hardware design approaches. These ciphers introduce confusion and diffusion by employing a 4 × 4 static substitution box and bit permutations. The bit-wise permutation is realised by simple rerouting, which is most cost-effective to implement in hardware, resulting in negligible power consumption. However, this method is highly resource-consuming in software, particularly for large block-sized ciphers, with each single-bit permutation requiring multiple sub-operations. This paper proposes a novel software-based design approach for permutation operation in Substitution bit Permutation Network based ciphers using a bit-banding feature. The conventional permutation using bit rotation and the proposed approach have been implemented, analysed and compared for GIFT and PRESENT ciphers on ARM Cortex-M3-based LPC1768 development platform with KEIL MDK used as an Integrated Development Environment. The real-time performance comparison between conventional and the proposed approaches in terms of memory (RAM/ROM) footprint, power, energy and execution time has been carried out using ULINKpro and ULINKplus debug adapters for various code and speed optimisation scenarios. The proposed approach substantially reduces execution time, energy and power consumption for both PRESENT and GIFT ciphers, thus demonstrating the efficiency of the proposed method for Substitution bit Permutation Network based symmetric block ciphers.
Title: An efficient permutation approach for SbPN-based symmetric block ciphers
Description:
Abstract It is challenging to devise lightweight cryptographic primitives efficient in both hardware and software that can provide an optimum level of security to diverse Internet of Things applications running on low-end constrained devices.
Therefore, an efficient hardware design approach that requires some specific hardware resource may not be efficient if implemented in software.
Substitution bit Permutation Network based ciphers such as PRESENT and GIFT are efficient, lightweight cryptographic hardware design approaches.
These ciphers introduce confusion and diffusion by employing a 4 × 4 static substitution box and bit permutations.
The bit-wise permutation is realised by simple rerouting, which is most cost-effective to implement in hardware, resulting in negligible power consumption.
However, this method is highly resource-consuming in software, particularly for large block-sized ciphers, with each single-bit permutation requiring multiple sub-operations.
This paper proposes a novel software-based design approach for permutation operation in Substitution bit Permutation Network based ciphers using a bit-banding feature.
The conventional permutation using bit rotation and the proposed approach have been implemented, analysed and compared for GIFT and PRESENT ciphers on ARM Cortex-M3-based LPC1768 development platform with KEIL MDK used as an Integrated Development Environment.
The real-time performance comparison between conventional and the proposed approaches in terms of memory (RAM/ROM) footprint, power, energy and execution time has been carried out using ULINKpro and ULINKplus debug adapters for various code and speed optimisation scenarios.
The proposed approach substantially reduces execution time, energy and power consumption for both PRESENT and GIFT ciphers, thus demonstrating the efficiency of the proposed method for Substitution bit Permutation Network based symmetric block ciphers.

Related Results

On Statistical Testing of Block Ciphers
On Statistical Testing of Block Ciphers
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in development of block ciphers, like any other cryptographic algorithms, is the analy...
Comprehensive Neural Cryptanalysis on Block Ciphers Using Different Encryption Methods
Comprehensive Neural Cryptanalysis on Block Ciphers Using Different Encryption Methods
In this paper, we perform the neural cryptanalysis and comprehensively analyze five block ciphers, Data Encryption Standard (DES), Simplified DES (SDES), Advanced Encryption Standa...
Practical Attacks of Round-Reduced SIMON Based on Deep Learning
Practical Attacks of Round-Reduced SIMON Based on Deep Learning
Abstract At CRYPTO’19, Gohr built a bridge between deep learning and cryptanalysis. Based on deep neural networks, he trained neural distinguishers of SPECK32/64. Be...
On Permutation BE-algebra
On Permutation BE-algebra
We present permutation BE-algebras as a new class of BE-algebras and examine their basic features in this work. The goal of this paper is to look into and discuss some new notions ...
Accelerating the Best Trail Search on AES-Like Ciphers
Accelerating the Best Trail Search on AES-Like Ciphers
In this study, we accelerate Matsui’s search algorithm to search for the best differential and linear trails of AES-like ciphers. Our acceleration points are twofold. The first exp...
MDS Diffusion Layers for Arithmetization-Oriented Symmetric Ciphers: The Rotational-Add Construction
MDS Diffusion Layers for Arithmetization-Oriented Symmetric Ciphers: The Rotational-Add Construction
We introduce the rotational-add diffusion layers aimed for applications in the design of arithmetization-oriented (AO) symmetric ciphers, such as fully homomorphic encryption (FHE)...
Reentrant permutation flow shop problems: definitions and heuristics
Reentrant permutation flow shop problems: definitions and heuristics
Abstract In a flow shop, jobs are serially processed on a set of machines and the machine order is the same for all the jobs. In a permutation flow shop, there is...
Problems and Progressive Cryptanalysis of Prominent Block Ciphers
Problems and Progressive Cryptanalysis of Prominent Block Ciphers
Practical cracking of Data Encryption Standard (DES) and mathematical cracking of Advanced Encryption Standard (AES) is seriously questionable despite the fact that AES retains goo...

Back to Top