PRESENT S-box Research Articles

MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes

Threshold implementation (TI) is a lightweight countermeasure against side-channel attacks when glitches happen. As to masking schemes, an S-box is the key part to protection. In this paper, we propose a general first-order lightweight TI scheme for 4 × 4 S-boxes and name it as MiniSat-lightweight-threshold implementation (MS-LW-TI). First, we use MiniSat to optimally decompose an S-box into the least number of three different logic gate operations, AND, OR, and XOR. Among these operations, we define two primitives and the extension of two primitives for TI design. Furthermore, we prove that the primitives and their extensions strictly comply with the security properties. Finally, we implement MS-LW-TI on Xilinx Spartan-6 Field Programmable Gate Array (FPGA) to show that the S-boxes of PRESENT, GIFT, and PICCOLO consume only 17, 15, and 13 look-up-tables (LUTs), 16, 9, and 16 flip-flops (FFs), 6, 5, and 6 slices, respectively. Compared with the existing lightweight TI design, our TI for PRESENT S-box has a 22%, 38%, and 25% reduction of LUTs, FFs, and slices to the design by Shahmirzadi and Moradi at IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) 2021, and our TI for GIFT S-box has a 6%, 25%, and 28% reduction of LUTs, FFs, and slices to the design by Jati et al., which is the smallest.

Generation S-box and P-layer For PRESENT Algorithm Based On 6D Hyper Chaotic System

In the era of data-driven applications and resource-constrained devices, the need for lightweight algorithms has become increasingly important. Lightweight algorithms refer to computational techniques that strike a balance between efficiency and resource utilization, making them well-suited for low-power devices, embedded systems, and scenarios with limited computational capabilities. For the new encryption method PRESENT, which was put forth in 2007, S-box directly affects the algorithm's security, whereas the p-layer mostly functions as a confusing factor during the encryption process. This paper provides a brief explanation of the PRESENT algorithm's operation and suggests an enhanced S-box and p-layer to address the issue that the main PRESENT S-box and P-layer have an anti-fixed point. The random generate of S-boxes and P-layers for PRESENT algorithms using 6D chaotic systems to generate 10 new S-boxes and 10 new P-layers. Finally, the security analysis has been completed, and the results indicate that the chaos S-box and P-layer are better able to with stand differential attacks and linear assaults and are suitable for protecting sensitive data.

A Novel Local Feature Generation Technique Based Sound Classification Method for Covid-19 Detection using Lung Breathing Sound

Lung breathing sounds have been used to diagnose many diseases, including Covid-19. Nowadays, Covid-19 has affected daily life worldwide, and it has caused a global pandemic. Generally, computer vision methods have been presented to classify healthy, pneumonia, and Covid-19. They achieved high classification rates on datasets with a limited number of classes without taking into consideration other lung diseases. Our main hypothesis is to detect Covid-19 automatically among other lung diseases by using lung breathing sounds. Therefore, a dataset of lung breathing sound with ten classes has been collected, and a novel lung sounds classification method has been proposed in this paper. This method presents a novel local feature generation technique, and Substitution Box (S-Box) of the present lightweight encryption method is utilized as a pattern. A novel nonlinear pattern is presented based on S-Box, named Present-SBox-Pat (present S-Box pattern). A new pooling-based transformation (maximum tent pooling (MaTP)) is proposed to generate high, middle, and low levels features. It is considered as a preprocessing method of this work. ReliefF and iterative neighbourhood component analysis (RFINCA) selector is used to select the most discriminative and informative features. Two shallow classifiers are used to obtain results. The proposed Present-SBox-Pat and MaTP feature generation network and RFINCA feature selector-based method achieved 95.43% classification accuracy using the SVM classifier. These results demonstrated the success of techniques in generating and selecting features that facilitate the task of classifiers.

Masking in Fine-Grained Leakage Models: Construction, Implementation and Verification

We propose a new approach for building efficient, provably secure, and practically hardened implementations of masked algorithms. Our approach is based on a Domain Specific Language in which users can write efficient assembly implementations and fine-grained leakage models. The latter are then used as a basis for formal verification, allowing for the first time formal guarantees for a broad range of device-specific leakage effects not addressed by prior work. The practical benefits of our approach are demonstrated through a case study of the PRESENT S-Box: we develop a highly optimized and provably secure masked implementation, and show through practical evaluation based on TVLA that our implementation is practically resilient. Our approach significantly narrows the gap between formal verification of masking and practical security.

Neural Network-based Inherently Fault-tolerant Hardware Cryptographic Primitives without Explicit Redundancy Checks

Fault injection-based cryptanalysis is one of the most powerful practical threats to modern cryptographic primitives. Popular countermeasures to such fault-based attacks generally use some form of redundant computation to detect and react/correct the injected faults. However, such countermeasures are shown to be vulnerable to selective fault injections. In this article, we aim to develop a cryptographic primitive that is fault tolerant by its construction and does not require to compute the same value multiple times. We utilize the effectiveness of Neural Networks (NNs), which show “some degree” of robustness by functioning correctly even after the occurrence of faults in any of its parameters. We also propose a novel strategy that enhances the fault tolerance of the implementation to “high degree” (close to 100%) by incorporating selective constraints in the NN parameters during the training phase. We evaluated the performance of revised NN considering both software and FPGA implementations for standard cryptographic primitives like 8×8 AES SBox and 4×4 PRESENT SBox. The results show that the fault tolerance of such implementations can be significantly increased with the proposed methodology. Such NN-based cryptographic primitives will provide inherent resistance against fault injections without requiring any redundancy countermeasures.

A Random PRESENT Encryption Algorithm Based on Dynamic S-box

S-box mainly plays the role of confusion in the encryption process as an important component. For the new encryption algorithm PRESENT proposed in 2007, S-box impacts on the security of the encryption algorithm directly. This paper briefly describes the process of PRESENT algorithm and proposes an improved S-box to solve the problem that the original PRESENT S-box has anti-fixed point. Then a random PRESENT encryption algorithm based on dynamic S-box is proposed. The dynamic multiple S-boxes technology is used to implement random PRESENT algorithm, to enhance the security of the cryptographic algorithm. Finally, the security analysis is done, and it suggests that dynamic S-box has a superior ability to resist differential attack and linear attack. By comparison to the diffusion rate of original PRESENT S-box, our dynamic S-box has better avalanche effect. With the rapid development of the Internet of Things, the radio frequency identification (RFID), wireless sensor network (WSN), and other new technologies go deep into all aspects of people's work and life. However, RFID and WSN are based on wireless network to transfer information. The transmission of information is not difficult to be obtained, interfered, and even destroyed by the attackers. So information security technology is widely used in protecting networks to enhance the safety of secret information. And the traditional symmetric encryption algorithm is often restricted by hardware, which cannot achieve good effects under the condition of limited hardware and power consumption. Therefore, lightweight cipher algorithm such as PRESENT(1) and LED(2) has gradually become the realistic choice to ensure the information security of Internet of Things. The lightweight block encryption algorithm PRESENT (1), put forward by Bogdanov in 2007, is carefully designed with area and power constraints uppermost in limited conditions. So the PRESENT algorithm still has high security in the application of limited space and power consumption, such as sensor network node. However, the permutation transformation of PRESENT algorithm is different with the column confusion of AES. It uses bit as the permutation function input unit while AES uses byte for permutation. The permutation layer of PRESENT encryption algorithm is a perfectly symmetrical structure and easy implemented. Because the structure of this kind of design has poor diffusibility, the PRESENT algorithm diffusively quality mainly depends on the diffusion properties of S-box. So S-box, as a nonlinear component in lightweight block encryption algorithm, affects the strength of the whole structure of the cipher. To strengthen DES by using existing hardware, an improved method of DES which uses the S-box related to a key is put forward in paper (4), and the researcher has demonstrated the safety of the improved method. Meanwhile, a new key related

Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures

We describe a new technique for evaluating polynomials over binary finite fields. This is useful in the context of anti-DPA countermeasures when an S-box is expressed as a polynomial over a binary finite field. For $$n$$ -bit S-boxes, our new technique has heuristic complexity $${\fancyscript{O}}(2^{n/2}/\sqrt{n})$$ instead of $${\fancyscript{O}}(2^{n/2})$$ proven complexity for the Parity-Split method. We also prove a lower bound of $${{\varOmega }}(2^{n/2}/\sqrt{n})$$ on the complexity of any method to evaluate $$n$$ -bit S-boxes; this shows that our method is asymptotically optimal. Here, complexity refers to the number of non-linear multiplications required to evaluate the polynomial corresponding to an S-box. In practice, we can evaluate any 8-bit S-box in 10 non-linear multiplications instead of 16 in the Roy–Vivek paper from CHES 2013, and the DES S-boxes in 4 non-linear multiplications instead of 7. We also evaluate any 4-bit S-box in 2 non-linear multiplications instead of 3. Hence our method achieves optimal complexity for the PRESENT S-box.