PRESENT Block Cipher Research Articles

Search for high-probability differential characteristics of the lightweight block cipher algorithm present with non-standard substitution blocks

The development of the Internet of Things and the associated devices has made it necessary to establish and implement encryption standards to ensure secure data transmission. These standards need to be comply with fundamental encryption principles and cater to devices with limited computational resources. As a result, lightweight cryptography has emerged as a distinct field within cryptography. The PRESENT block cipher algorithm is a lightweight encryption algorithm designed for deployment in resource-constrained devices. It requires comprehensive and ongoing vulnerability analysis against both known and novel cryptanalysis methods. This work extensively investigates the PRESENT block cipher algorithm, examining its components, operational principles, and key scheduling algorithm. This study analyses existing research on the algorithm with regards to contemporary cryptanalysis methods. Differential cryptanalysis was selected as the method of choice. The requirements for constructing S-boxes, as set forth by the algorithm developers, are reviewed. Two alternative S-boxes are formulated and presented based on these requirements. The paper presents a methodology for identifying high-probability differential characteristics for the PRESENT algorithm, using a substitute substitution block that differs from the one proposed by the developers. The research reports on the encryption algorithm PRESENT, using alternative substitution blocks, and evaluates its resistance to differential cryptanalysis. The text presents the results of applying the methodology for searching differential characteristics to the substituted blocks in the PRESENT algorithm. A comparative analysis is made between the results obtained through the differential characteristic search methodology for the PRESENT algorithm with alternative substitution blocks and the known results for this algorithm.

Enhancing IoT security using lightweight key management with PRESENT for resource-constrained devices

The increasing number of Internet of Things (IoT) devices in different areas has led to worries about their susceptibility to security risks because of their limited resources. This study aims to improve IoT security by utilizing a streamlined key management system based on the PRESENT block cipher algorithm. The proposed method is compared to TinyIKE and Elliptic Curve Diffie-Hellman (ECDH) using key parameters like Encryption Time, Decryption Time, Storage Usage, Energy Consumption, and Key Entropy. The paper’s introduction contextualizes the importance of securing IoT devices, highlighting the difficulties caused by their restricted computational capabilities. The research proposes using the PRESENT algorithm for key management systems because of its lightweight characteristics and compatibility with resource-limited environments. The proposed method will be thoroughly analyzed across different parameters to evaluate its performance in comparison to current solutions. The research shows that the suggested lightweight key management scheme using PRESENT is more effective than TinyIKE and ECDH in Encryption Time, Decryption Time, Storage Usage, Energy Consumption, and Key Entropy. The results demonstrate the effectiveness of the suggested approach in meeting the particular security needs of IoT devices with limited resources. This research enhances IoT security by proposing a lightweight key management method that efficiently tackles the issues caused by resource-limited devices. The comparative analysis demonstrates that the proposed method outperforms others, indicating its potential as an effective solution for securing IoT ecosystems in practical scenarios.

Key-based dynamic S-Box approach for PRESENT lightweight block cipher

Key-based dynamic S-Box approach for PRESENT lightweight block cipher

Secured authentication of radio-frequency identification system using PRESENT block cipher

<span lang="EN-US">The internet of things (IoT) is an emerging and robust technology to interconnect billions of objects or devices via the internet to communicate smartly. The radio frequency identification (RFID) system plays a significant role in IoT systems, providing most features like mutual establishment, key establishment, and data confidentiality. This manuscript designed secure authentication of IoT-based RFID systems using the light-weight PRESENT algorithm on the hardware platform. The PRESENT-256 block cipher is considered in this work, and it supports 64-bit data with a 256-key length. The PRESENT-80/128 cipher is also designed along with PRESENT-256 at electronic codebook (ECB) mode for Secured mutual authentication between RFID tag and reader for IoT applications. The secured authentication is established in two stages: Tag recognition from reader, mutual authentication between tag and reader using PRESENT-80/128/256 cipher modules. The complete secured authentication of IoT-based RFID system simulation results is verified using the chip-scope tool with field-programmable gate array (FPGA) results. The comparative results for PRESENT block cipher with existing PRESENT ciphers and other light-weight algorithms are analyzed with resource improvements. The proposed secured authentication work is compared with similar RFID-mutual authentication (MA) approaches with better chip area and frequency improvements.</span>

Lightweight digital imaging and communications in medicine image encryption for IoT system

Diagnosis in healthcare systems relies heavily on the use of medical images. Images such as X-rays, ultrasounds, computed tomography (CT) scans, magnetic resonance imaging (MRIs), and other scans of the brain and other internal organs of patients include private and personal information. However, these images are vulnerable to unauthorized users who unlawfully use them for non-diagnostic reasons due to the lack of security in communication routes and the gaps in the storage systems of hospitals or medical centers. Image encryption is a prominent technique used to protect medical images from unauthorized access in addition to enhancing the security of communication networks. In this paper, researchers offer a lightweight cryptosystem for the secure encryption of medical images that makes use of the present block cipher and a five-dimensional chaotic map. More than 25 images from the open science framework (OSF) public database of patients with coronavirus disease 2019 (COVID-19) were used to evaluate the proposed system. DICOM stands for “digital imaging and communications in medicine”. The efficiency of the proposed system is proved in terms of adjacent pixels’ correlation analysis, National Institute of Standards and Technology (NIST) analysis, mean square error, information entropy, unified average changing intensity, peak-to-signal noise ratio, entropy, and structure similarity index image.

Error‐correcting cryptographic S‐boxes with multiple error detection and correction

SummaryIn this paper, the error‐correcting 4‐bit S‐boxes for cryptography applications with multiple error detection and correction are presented. Three 4‐bit S‐boxes which are used in the lightweight block ciphers PRESENT, Midori, and KLEIN are considered for implementation of the error‐correcting method. The proposed method does not require two redundant S‐boxes for repairing the S‐box. The main circuit of the S‐box is implemented concurrently with the low‐cost error‐correcting part of the structure. This reduces the overall area consumption and delay of the proposed error‐correcting method (the area consists of the 4‐bit S‐box and self‐checking/error‐correcting circuits). In the proposed error‐correcting method, the outputs of the S‐box are tested individually and it can detect and repair transient and permanent faults simultaneously. Therefore, the structure can detect and repair the single, double, triple, and quadruple faults at a time. The area and timing results, in 180 nm CMOS technology, show the proposed structures are acceptable in terms of area and delay overheads than those of the other methods.

A Flexible Architecture for Cryptographic Applications: ECC and PRESENT

This work presents a flexible/unified hardware architecture of Elliptic-curve Cryptography (ECC) and PRESENT for cryptographic applications. The features of the proposed work are (i) computation of only the point multiplication operation of ECC over for a 163-bit key generation, (ii) execution of only the variant of an 80-bit PRESENT block cipher for data encryption & decryption and (iii) execution of point multiplication operation (ECC algorithm) along with the data encryption and decryption (PRESENT algorithm). To establish an area overhead for the flexible design, dedicated hardware architectures of ECC and PRESENT are implemented in the first step, and a sum of their hardware area is computed. Then, the implementation of the proposed flexible architecture for ECC and PRESENT algorithms is presented. Implementation results regarding the area, clock cycles, latency, clock frequency, and power after the place-and-route level on Xilinx Virtex-5, Virtex-6, and Virtex-7 FPGA devices are presented. Hence, the implementation results and comparisons show that the proposed architecture suits applications demanding flexible implementation of cryptographic applications.

Secure and Robust Internet of Things with High-Speed Implementation of PRESENT and GIFT Block Ciphers on GPU

With the advent of the Internet of Things (IoT) and cloud computing technologies, vast amounts of data are being created and communicated in IoT networks. Block ciphers are being used to protect these data from malicious attacks. Massive computation overheads introduced by bulk encryption using block ciphers can become a performance bottleneck of the server, requiring high throughput. As the need for high-speed encryption required for such communications has emerged, research is underway to utilize a graphics processor for encryption processing based on the high processing power of the GPU. Applying bit-slicing of lightweight ciphers was not covered in the previous implementation of lightweight ciphers on GPU architecture. In this paper, we implemented PRESENT and GIFT lightweight block ciphers GPU architectures. It minimizes the computation overhead caused by optimizing the algorithm by applying the bit-slicing technique. We performed practical analysis by testing practical use cases. We tested PRESENT-80, PRESENT-128, GIFT-64, and GIFT-128 block ciphers in RTX3060 platforms. The throughput of the exhaustive search are 553.932 Gbps, 529.952 Gbps, 583.859 Gbps, and 214.284 Gbps for PRESENT-80, PRESENT-128, GIFT-64, and GIFT-128, respectively. For the case of data encryption, it achieved 24.264 Gbps, 24.522 Gbps, 85.283 Gbps, and 10.723 Gbps for PRESENT-80, PRESENT-128, GIFT-64, and GIFT-128, respectively. Specifically, the proposed implementation of a PRESENT block cipher is approximately 4× higher performance than the latest work that implements PRESENT block cipher. Lastly, the proposed implementation of a GIFT block cipher on GPU is the first implementation for the server environment.

Design, integration and implementation of crypto cores in an SoC environment

PurposeThe paper aims to develop a systematic approach to design, integrate, and implement a set of crypto cores in a system-on-chip SoC) environment for data security applications. The advanced encryption standard (AES) and PRESENT block ciphers are deployed together, leading to a common crypto chip for performing encryption and decryption operations.Design/methodology/approachAn integrated very large-scale integration (VLSI) architecture and its implementation for the AES and PRESENT ciphers is proposed. As per the choice, the architecture performs encryption or decryption operations for the selected cipher. Experimental results of the field-programmable gate array (FPGA) and application-specific integrated circuit (ASIC) implementations and related design analysis are provided.FindingsFPGA implementation of the architecture on Xilinx xc5vfx70t-1-ff1136 device consumes 19% slices, whereas the ASIC design is implemented in 180 nm complementary metal-oxide semiconductor ASIC technology that takes 1.0746 mm2 of standard cell area and consumes 14.26 mW of power at 50 MHz clock frequency. A secure audio application using the designed architecture on an open source SoC environment is also provided. A test methodology for validation of the designed chip using an FPGA-based platform and tools is discussed.Originality/valueThe proposed architecture is compared with a set of existing hardware architectures for analyzing various design metrics such as latency, area, maximum operating frequency, power, and throughput.

Light-Weight Present Block Cipher Model for IoT Security on FPGA

The Internet of Things (IoT) plays an essential role in connecting a small number of billion devices with people for diverse applications. The security and privacy with authentication are challenging work for IoT devices. A light-weight block cipher is designed and modeled with IoT security for real-time scenarios to overcome the above challenges. The light-weight PRESENT module with the integration of encryption (E)-decryption (D) is modeled and implemented on FPGA. The PRESENT module has 64-bit data input with 80/128/256-bit symmetric keys for IoT security. The PRESENT module performs16/32/64 round operations for state register and key updation. The design mainly uses Substitution-permutation (SP) network for state updation. The permutation layer is used to create more diffusion and confusion in the state for unauthorized access. The results and analysis of the PRESENT-80/128/256 are designed using Verilog-HDL with Xilinx Environment and implemented on Artix-7 FPGA. The PRESENT-80/128/256 module is compared with similar recent works with performance improvements. Similarly, the proposed work is compared with different light-weight algorithms with improvements for better security in IoT devices. The proposed PRESENT-256 module with 64-rounds on Artix-7 FPGA utilizes less than 2% Chip area (Slices and LUTs), works at 412.4 MHz frequency, and consumes 192 mW total power and 0.58 Mbps/slice of hardware efficiency.

Mod-k-Chained Variant of PRESENT and CLEFIA Lightweight Block Cipher for an Improved Security in Internet of Things

Mod-k-Chained Variant of PRESENT and CLEFIA Lightweight Block Cipher for an Improved Security in Internet of Things

Integral Distinguishers of the Full-Round Lightweight Block Cipher SAT_Jo

Integral cryptanalysis based on division property is a powerful cryptanalytic method whose range of successful applications was recently extended through the use of Mixed-Integer Linear Programming (MILP). Although this technique was demonstrated to be efficient in specifying distinguishers of reduced round versions of several families of lightweight block ciphers (such as SIMON, PRESENT, and few others), we show that this method provides distinguishers for a full-round block cipher SAT_Jo. SAT_Jo cipher is very similar to the well-known PRESENT block cipher, which has successfully withstood the known cryptanalytic methods. The main difference compared to PRESENT, which turns out to induce severe weaknesses of SAT_Jo algorithm, is its different choice of substitution boxes (S-boxes) and the bit-permutation layer for the reasons of making the cipher highly resource-efficient. Even though the designers provided a security analysis of this scheme against some major generic cryptanalytic methods, an application of the bit-division property in combination with MILP was not considered. By specifying integral distinguishers for the full-round SAT_Jo algorithm using this method, we essentially disapprove its use in intended applications. Using a 30-round distinguisher, we also describe a subkey recovery attack on the SAT_Jo algorithm whose time complexity is about 2 66 encryptions (noting that SAT_Jo is designed to provide 80 bits of security). Moreover, it seems that the choice of bit-permutation induces weak division properties since replacing the original bit-permutation of SAT_Jo by the one used in PRESENT immediately renders integral distinguishers inefficient.

DL-LA: Deep Learning Leakage Assessment

In recent years, deep learning has become an attractive ingredient to side-channel analysis (SCA) due to its potential to improve the success probability or enhance the performance of certain frequently executed tasks. One task that is commonly assisted by machine learning techniques is the profiling of a device’s leakage behavior in order to carry out a template attack. At CHES 2019, deep learning has also been applied to non-profiled scenarios for the first time, extending its reach within SCA beyond template attacks. The proposed method, called DDLA, has some tempting advantages over traditional SCA due to merits inherited from (convolutional) neural networks. Most notably, it greatly reduces the need for pre-processing steps< when the SCA traces are misaligned or when the leakage is of a multivariate nature. However, similar to traditional attack scenarios the success of this approach highly depends on the correct choice of a leakage model and the intermediate value to target. In this work we explore, for the first time in literature, whether deep learning can similarly be used as an instrument to advance another crucial (non-profiled) discipline of SCA which is inherently independent of leakage models and targeted intermediates, namely leakage assessment. In fact, given the simple classification-based nature of common leakage assessment techniques, in particular distinguishing two groups fixed-vs-random or fixed-vs-fixed, it comes as a surprise that machine learning has not been brought into this context, yet. Our contribution is the development of the first full leakage assessment methodology based on deep learning. It gives the evaluator the freedom to not worry about location, alignment and statistical order of the leakages and easily covers multivariate and horizontal patterns as well. We test our approach against a number of case studies based on FPGA, ASIC and μC implementations of the PRESENT block cipher, equipped with state-of-the-art SCA countermeasures. Our results clearly show that the proposed methodology and network structures are robust across all case studies and outperform the classical detection approaches (t-test and X2-test) in all considered scenarios.

Countermeasures against Static Power Attacks

In recent years it has been demonstrated convincingly that the standby power of a CMOS chip reveals information about the internally stored and processed data. Thus, for adversaries who seek to extract secrets from cryptographic devices via side-channel analysis, the static power has become an attractive quantity to obtain. Most works have focused on the destructive side of this subject by demonstrating attacks. In this work, we examine potential solutions to protect circuits from silently leaking sensitive information during idle times. We focus on countermeasures that can be implemented using any common digital standard cell library and do not consider solutions that require full-custom or analog design flow. In particular, we evaluate and compare a set of five distinct standard-cell-based hiding countermeasures, including both, randomization and equalization techniques. We then combine the hiding countermeasures with state-of-the-art hardware masking in order to amplify the noise level and achieve a high resistance against attacks. An important part of our contribution is the proposal and evaluation of the first ever standard-cell-based balancing scheme which achieves perfect data-independence on paper, i.e., in absence of intra-die process variations and aging effects. We call our new countermeasure Exhaustive Logic Balancing (ELB). While this scheme, applied to a threshold implementation, provides the highest level of resistance in our experiments, it may not be the most cost effective option due to the significant resource overhead associated. All evaluated countermeasures and combinations thereof are applied to a serialized hardware implementation of the PRESENT block cipher and realized as cryptographic co-processors on a 28nm CMOS ASIC prototype. Our experimental results are obtained through real-silicon measurements of a fabricated die of the ASIC in a temperature-controlled environment using a source measure unit (SMU). We believe that our elaborate comparison serves as a useful guideline for hardware designers to find a proper tradeoff between security and cost for almost any application.

RETRACTED ARTICLE: The importance of light-weight encryption cipher in restricted IoT systems to make intelligent technology safer for devices

Light-weight Cryptography is a subset of cryptography that aims to create interaction with low-power enabled devices. The use of constrained devices in most of the fields has created the need of light-weight cryptography. Many modern algorithms are designed to be used without hardware optimization tools as part of a computer software framework. This reality makes it difficult for devices with minimal computing capacity, small volumes, and low power consumption to use most current cryptographic algorithms. The foundation of light-weight cryptography has become cryptographic data protection techniques in low-cost systems. Light-weight cryptography is important in the case of the providing security to wireless sensor devices. Light-weight algorithm developers are sometimes forced to choose between two algorithm criteria, often mutually specific: protection, cost, and productivity. In practice, two of the three design goals are easy to optimize: protection and expense, while it is very challenging to simultaneously optimize all three design goals, safety and efficiency or cost and performance. Several Light-weight Cryptography algorithms are implemented in this respect: software and hardware. They have several and frequently contradictory features. In this regard two types of ciphers were used depending on the algorithm: one is block cipher and the other is stream cipher. In this paper, we are going to discuss the major role of Light-weight Cryptography in IoT devices and its challenges to run constrained devices in a specific Filed. As previously stated, the limitations of the research Lightweight Block Ciphers PRESENT, CLEFIA and Stream Ciphers Grain, Rabbit will be discussed.

Efficient Implementation of PRESENT and GIFT on Quantum Computers

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

On Evaluating Fault Resilient Encoding Schemes in Software

Cryptographic implementations are often vulnerable against physical attacks, fault injection analysis being among the most popular techniques. On par with development of attacks, the area of countermeasures is advancing rapidly, utilizing both hardware- and software-based approaches. When it comes to software encoding countermeasures for fault protection and their evaluation, there are very few proposals so far, mostly focusing on single operations rather than cipher as a whole. In this paper we propose an evaluation framework that can be used for analyzing the effectivity of software encoding countermeasures against fault attacks. We first formalize the encoding schemes in software, helping us to define what properties are required when designing a fault protection. Based on these findings, we develop an evaluation metric that can be used universally to determine the robustness of a software encoding scheme against bit flip faults and instruction skips. We provide a way to select a code according to user criteria and also a dynamic code analysis method to estimate the level of protection of assembly implementations using encoding schemes. Finally, we verify our findings by implementing a block cipher PRESENT, protected by encoding scheme based on anticodes, and provide a detailed evaluation of this implementation using different codes.

A CPU-GPU-based parallel search algorithm for the best differential characteristics of block ciphers

The differential characteristics with high probability are critical for differential cryptanalysis. The process of searching such differential characteristics, especially the best one, is time-consuming. We believe that the modern hybrid computing systems can be used to accelerate the search process. However, to the best of our knowledge, the existing solutions are not designed for heterogeneous architectures. In this paper, we propose a parallel search algorithm for the best differential characteristic. Our method can be applied to any substitution–permutation network (SPN) block ciphers after making minor modifications. We implemented the proposed parallel search algorithm for PRESENT block cipher and also a sequential version, which based on the classic Matsui’s method, for comparison. The experimental result shows that the parallel algorithm using both CPU and GPU can achieve at least 4.4x and up to 18x speed-up compared to the sequential version.

A tutorial of boomerang attack on SMALLPRESENT-[4

In 2010, Leander proposed a new version of the block cipher PRESENT with smaller block size, namely SMALLPRESENT-[n]. This algorithm is designed to deepen understanding of how the running time of the algorithm and the vulnerability of attack during the round increase with the number of rounds and s-boxes not determined on the algorithm. The boomerang attack is a variation of the differential attack introduced by Wagner in 1999. This attack uses two differential characteristics that are mutually independent in short rounds with high probability. This paper intends to present a lucid explanation of the boomerang attack. We illustrate the practical application of the boomerang attacks on two rounds of the SMALLPRESENT-[4], that includes the steps to find differential characteristic until key recovery, and explain the concept of attack for novice cryptanalysis. Based on experiments conducted, we found a boomerang differential characteristic on two rounds of SMALLPRESENT-[4] with a probability 2-10 and 4-bit subkey in the first round of the algorithm.

New results in biclique cryptanalysis of full round GIFT

Security of a recently proposed bitwise block cipher GIFT is evaluated in this paper. In order to mount full round attacks on the cipher, biclique cryptanalysis method is applied. Both variants of the block cipher are attacked using Independent biclique approach. For recovering the secret keys of GIFT-64, the proposed attack requires 2127.45 full GIFT-64 encryption and 28 chosen plain texts. For recovering the secret keys of GIFT-128, the proposed attack requires 2127.82 full GIFT-128 encryption and 218 chosen plain texts. The attack complexity is compared with that of other attacks proposed previously. The security level of GIFT is also compared with that of the parent block cipher PRESENT, based on the analysis.