Search

With the rapid development of the Internet of Things (IoT), IoT applications face more and more security threats. However, IoT devices are resource-constrained and need lightweight encryption schemes. In this paper, a new lightweight stream cipher DCC-128 based on the nonlinear chaotic coupling function is proposed. Inspired by a dynamically coupled chaotic map, a state-driven approach to changing the chaotic coupling structure is used to enhance security. The proposed chaotic function has good dynamical performance and can be easily implemented on the hardware platforms, thus it is used as the main nonlinear drive of DCC-128. With simple operations such as modular addition, shift, and XOR, DCC-128 has high implementation efficiency and is a hardware-oriented design. The security analysis indicates that common attacks are not likely to affect its security. The hardware performance is compared with the lightweight cryptographic standards and the latest lightweight ciphers. Moreover, the recommended randomness test shows good statistical properties, we believe that DCC-128 is less vulnerable to distinguishing attacks. All results show that DCC-128 is a competitive lightweight stream cipher for resource-constrained devices. [ABSTRACT FROM AUTHOR]

It is known that the sponge construction is tightly indifferentiable from a random oracle up to around 2c/2 queries, where c is the capacity. In particular, it cannot provide generic security better than half of the underlying permutation size. In this paper, we aim to achieve hash function security beating this barrier. We present a hashing mode based on two b-bit permutations named the double sponge. The double sponge can be seen as the sponge embedded within the double block length hashing paradigm, making two permutation calls in parallel interleaved with an efficient mixing function. Similarly to the sponge, the permutation size is split as b = r+c, and the underlying compression function absorbs r bits at a time. We prove that the double sponge is indifferentiable from a random oracle up to around 22c/3 queries. This means that the double sponge achieves security beyond the birthday bound in the capacity. In addition, if c > 3b/4, the double sponge beats the birthday bound in the primitive size, to our knowledge being the first hashing mode based on a permutation that accomplices this feature.

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.

In resource-intensive Internet of Things applications, Lightweight Stream Ciphers (LWSCs) play a vital role in influencing both the security and performance of the system. Numerous LWSCs have been proposed, each offering certain properties and trade-offs that carefully balance security and performance requirements. This paper presents a comprehensive evaluation of prominent LWSCs, with a focus on their performance and resource consumption, providing insights into efficiency, efficacy, and suitability in the real-world application of resource-intensive live video feed encryption on an ARM processor. The study involves the development of a benchmarking tool designed to evaluate key metrics, including encryption frame rate, throughput, processing cycles, memory footprint, ROM utilization, and energy consumption. In addition, we apply the E−Rank metric, which combines key performance and resource metrics to derive a unified comparative measure for overall software performance.

The Internet of Things (IoT) has gained popularity in various fields, including components such as embedded devices and wireless sensors. However, ensuring the security of data transmission from these devices is of critical importance. In light of these challenges, a novel lightweight encryption method called DRcipher is proposed in this paper for resource-constrained IoT devices. DRcipher has a 64-bit block size and supports either 96-bit or 128-bit key sizes. In order to improve the security, DRcipher employs a pseudo-random number of encryption rounds determined by the primary key. DRcipher adopts the structure of Generalized Feistel Network (GFN) with 4 branches, and its round functions consist of F-function, FF-function and RP permutation components. In particular, there is a negative feedback mechanism between the FF-function and the overall round of encryption functions. In addition, DRcipher is synthesised using Synopsys Design Compiler version A-2007.12-SP1 and the UMCL18G212T3 standard cell library. DRcipher-96 has an area footprint of 1546 Gate Equivalents (GE), while DRcipher-128 has a slightly larger area footprint of 1646 GE. Moreover, a comprehensive security analysis shows that the proposed DRcipher ensures high-level security redundancy against differential cryptanalysis, linear cryptanalysis, and so on.

Maximum distance separable (MDS) matrices are often used in the linear layer of a block cipher due to their good diffusion property. A well-designed lightweight MDS matrix, especially an involutory one, can provide both security and performance benefits to the cipher. Finding the corresponding effective linear straight-line program (SLP) of the circuit of a linear layer is still a challenging problem. In this article, first, we propose a new heuristic algorithm called Superior Boyar-Peralta (SBP) in the computation of the minimum number of two-input Exclusive-OR (XOR) gates with the minimum circuit depth for the SLPs. Contrary to the existing global optimization methods supporting only two-input XOR gates, SBP heuristic algorithm provides the best global optimization solutions, especially for extracting low-latency circuits. Moreover, we give a new 4 × 4 involutory MDS matrix over F24, which requires only 41 XOR gates and depth 3 after applying SBP heuristic, whereas the previously best-known cost is 45 XOR gates with the same depth. In the second part of the article, for further optimization of the circuit area of linear layers with multiple-input XOR gates, we enhance the recently proposed BDKCI heuristic algorithm by incorporating circuit depth awareness, which limits the depth of the circuits created. By using the proposed circuit depth-bounded version of BDKCI, we present better circuit implementations of linear layers of block ciphers than those given in the literature. For instance, the given circuit for the AES MixColumn matrix only requires 44 XOR gates/depth 3/240.95 GE in the STM 130 nm (simply called ASIC4) library, while the previous best-known result is 55 XOR gates/depth 5/243.00 GE. Much better, our new 4 × 4 involutory MDS matrix requires only 19 XOR gates/depth3/79.75 GE in the STM 90 nm (simply called ASIC1) library, which is the lightest and superior to the state-of-the-art results.

WG-5 is a lightweight stream cipher proposed for usage in the resource-constrained devices, e.g., passive RFID tags, industrial controllers, contactless smart cards and sensors. In this paper, a weakness called slide property of WG-5 which has not been discovered in previous works is for the first time explored and analyzed. The result shows that the probability that two related key-IV pairs of WG-5 generate the shifted keystreams can be up to 2−20, which is significantly high compared with an ideal stream cipher that generates the random keystreams. The correctness and accuracy of this theoretical probability is confirmed experimentally. Based on the slide property of WG-5, some key recovery attacks on WG-5 in the related key setting are proposed. The cryptanalytic result shows that the 80-bit secret key of WG-5 can be recovered with a time complexity of 225.615, requiring 6 related keys and 80 keystream bits for each of 224.585 chosen IVs. The experimental result validates our attack and shows that WG-5 can be broken within about 92.054 seconds on a common PC in the related key setting. These results imply that the design of WG-5 is far from optimal and needs to be strengthened to provide enough security for the lightweight constrained applications.

The IoT technology is currently used in many areas and marked by growing popularity. On the one hand, the IoT makes our lives easier, on the other hand, it presents challenges in terms of security and privacy protection. An IoT infrastructure is characterized by a high level of threats due to, inter alia, numerous technical barriers that make it difficult to use conventional methods to protect information. The aim of this paper is to present a symmetric coding algorithm based on algebraic groups generated by specific trigonometric curves. The algorithm is dedicated to short data sequences transmitted by devices with limited computing power.

Determining bounds on the differential probability of differential trails and the squared correlation contribution of linear trails forms an important part of the security evaluation of a permutation. For Xoodoo, such bounds were proven using the trail core tree search technique, with a dedicated tool (XooTools) that scans the space of all r-round trails with weight below a given threshold Tr. The search space grows exponentially with the value of Tr and XooTools appeared to have reached its limit, requiring huge amounts of CPU time to push the bounds a little further. The bottleneck was the phase called trail extension where short trails are extended to more rounds, especially in the backward direction. In this work, we present a number of techniques that allowed us to make extension much more efficient and as such to increase the bounds significantly. Notably, we prove that the minimum weight of any 4-round trail is 80, the minimum weight of any 6-round trail is at least 132 and the minimum weight of any 12-round trail is at least 264, both for differential and linear trails. As a byproduct we found families of trails that have predictable weight once extended to more rounds and use them to compute upper bounds for the minimum weight of trails for arbitrary numbers of rounds.

In recent years, lightweight cryptography has been a hot field in symmetric cryptography. One of the most crucial problems is to find low-latency implementations of linear layers. The current main heuristic search methods include the Boyar-Peralta (BP) algorithm with depth limit and the backward search. In this paper we firstly propose two improved BP algorithms with depth limit mainly by minimizing the Euclidean norm of the new distance vector instead of maximizing it in the tie-breaking process of the BP algorithm. They can significantly increase the potential for finding better results. Furthermore, we give a new framework that combines forward search with backward search to expand the search space of implementations, where the forward search is one of the two improved BP algorithms. In the new framework, we make a minor adjustment of the priority of rules in the backward search process to enable the exploration of a significantly larger search space. As results, we find better results for the most of matrices studied in previous works. For example, we find an implementation of AES MixColumns of depth 3 with 99 XOR gates, which represents a substantial reduction of 3 XOR gates compared to the existing record of 102 XOR gates.

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. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) have become increasingly popular in recent years and are applied in various fields, from commercial and scientific to military and humanitarian operations. However, their usage presents many challenges, including limited resources, scalability issues, insecure communication, and inefficient solutions. We developed a secure and scalable registration protocol to address these issues using LoRa technology. Our solution involves the usage of the physical unclonable function (PUF) and blockchain technology for key exchange. PUF also ensures security against physical tampering, and blockchain is applied to share the symmetric key among the base stations. After the registration, the later communication messages are encrypted with AES-GCM to provide authentication and confidentiality between the parties. We conducted a security analysis of the registration protocol using the ProVerif tool, and our solution meets the security requirements, including the mutual authentication of entities, key freshness, key secrecy and also key confirmation properties. Besides the Proverif-based analysis, an informal security analysis is also provided that shows that the registration is protected against a variety of well-known active and passive security attacks. As drone resources are limited, we also prepared a proof of concept to test our solution under real-life conditions, focusing on efficiency and lightweight operations. [ABSTRACT FROM AUTHOR]

Recently, most modern cars can be controlled with the Remote Keyless System (RKS). A Remote Keyless System consists of a key fob that communicates wirelessly with the car transceiver that is used to control and secure access to the vehicle. The keyless entry systems are based on RFID communication and are equipped with limited computation and power resources. It was proven to be a target for cybercriminals. In this work, we proposed the use of the LED block cipher for data encryption-decryption of the keyless entry systems. The proposed hardware architecture of the LED algorithm was optimized to fit the limited resources of the keyless entry systems. The proposed 8-bit sequential architecture contains 627 LUTs+FFs. To further reduce hardware resources, we proposed a 4-bit architecture for the MixColumns sub-function, which gives good results in occupying hardware resources by reducing it to 597 LUTs+FFs. This leads to a good effect on the area implementation and power consumption of keyless entry systems. Thus, the proposed LED hardware architecture may be applied to lightweight applications that demand a high level of secrecy such as the key fob. In order to adopt the proposed design of the LED block cipher as a security system for keyless entry systems, we examine the security of the proposed LED architecture using five metrics; entropy analysis, histogram analysis, correlation analysis, NPCR, and UACI. As a result, the LED block cipher has a good ability to encrypt any data against any attack. [ABSTRACT FROM AUTHOR]

This research paper presents a study on designing and implementing a robust key management scheme for lightweight block ciphers in Internet of Things (IoT) networks. Key management is a critical concern for IoT devices due to their limited resources and susceptibility to security threats. The proposed scheme utilises partial key pre-distribution to achieve lightweight and secure key management. The protocol's security has been analysed against various attacks, demonstrating its resistance. Performance evaluation results indicate that the proposed key management technique is suitable for resource-constraint IoT networks, as it reduces communication overhead, power consumption, and storage space requirements. The methodology employed in this research includes designing and implementing the proposed key management scheme and conducting scenario-based analyses of its functionality. The results affirm that the proposed solution effectively ensures secure communication in IoT networks. Overall, this research contributes to developing a secure and efficient key management scheme for lightweight block ciphers in IoT networks. [ABSTRACT FROM AUTHOR]

IoT devices and embedded systems are deployed in critical environments, emphasizing attributes like power efficiency and computational capabilities. However, these constraints stress the paramount importance of device security, stimulating the exploration of lightweight cryptographic mechanisms. This study introduces a lightweight architecture for authenticated encryption tailored to these requirements. The architecture combines the lightweight encryption of the LED block cipher with the authentication of the PHOTON hash function. Leveraging shared internal operations, the integration of these bases optimizes area–performance tradeoffs, resulting in reduced power consumption and a reduced logic footprint. The architecture is synthesized and simulated using Verilog HDL, Quartus II, and ModelSim, and implemented on Cyclone FPGA devices. The results demonstrate a substantial 14% reduction in the logic area and up to a 46.04% decrease in power consumption in contrast to the individual designs of LED and PHOTON. This work highlights the potential for using efficient cryptographic solutions in resource-constrained environments. [ABSTRACT FROM AUTHOR]

This paper presents a brief review of ciphering methods for secure image communications in the contexts of Internet of Things (IoT) and artificial intelligence. With the rapid advancements in mobile computing and the diversity of public data storing devices, ensuring robust security mechanisms has become a critical area of focus. We acknowledge the importance of historical context and the evolution of encryption/decryption approaches, and we aim to establish a systematic understanding of lightweight image encryption in IoT applications. To this end, a use case for AES image encryption will be highlighted to provide practical insights. Moreover, an abstract ciphering approach is suggested towards limiting the image-related de-anonymization attacks which can occur over publicly shared trained image sets. [ABSTRACT FROM AUTHOR]

INTRODUCTION: IoT devices are small, have limited battery and computing capabilities, and cannot tolerate complex encryption. So there is a need for a lightweight cryptographic scheme that can perform well in resource constraint environments. OBJECTIVES: Many encryption algorithms struggle to balance security and complexity. Increasing the level of protection necessitates increasing complexity, which leads to higher encryption and decryption times. The goal of this article is to offer a novel encryption method, the Modified Rijndael Algorithm, which balances security and complexity. METHODS: The classic Rijndael encryption technique has been modified to make it lighter and more secure, suitable for resource-constrained IoT devices. These modifications include adding the novel pre-processing step Crossover based on the two-point crossover operation of genetic algorithms, removing the Sub Byte step, changing the shift column phase, and decreasing the rounds. RESULTS: The proposed scheme provides speed and high security, increasing efficiency and randomness while reducing encryption and decryption times by 21.06% and CPU consumption by 13.2% compared to the traditional method. CONCLUSION: The proposed algorithm reduces encryption time and maintains the complexity needed to protect the data. It is lighter and more secure, making it suitable for IoT devices with limited resources. [ABSTRACT FROM AUTHOR]

This article presents a new hybrid method (combining search based methods and direct construction methods) to generate all 4×4 involutory maximum distance separable (MDS) matrices over F2m. The proposed method reduces the search space complexity at the level of ffiffiffinp, where n represents the number of all 4×4 invertible matrices over F2m to be searched for. Hence, this enables us to generate all 4×4 involutory MDS matrices over F23 and F24. After applying global optimization technique that supports higher Exclusive-OR (XOR) gates (e.g., XOR3, XOR4) to the generated matrices, to the best of our knowledge, we generate the lightest involutory/non-involutory MDS matrices known over F23, F24 and F28 in terms of XOR count. In this context, we present new 4×4 involutory MDS matrices over F23, F24 and F28, which can be implemented by 13 XOR operations with depth 5, 25 XOR operations with depth 5 and 42 XOR operations with depth 4, respectively. Finally, we denote a new property of Hadamard matrix, i.e., (involutory and MDS) Hadamard matrix form is, in fact, a representative matrix form that can be used to generate a small subset of all 2k×2k involutory MDS matrices, where k > 1. For k = 1, Hadamard matrix form can be used to generate all involutory MDS matrices. [ABSTRACT FROM AUTHOR]

Data compression combined with effective encryption is a common requirement of data storage and transmission. Low cost of these operations is often a high priority in order to increase transmission speed and reduce power usage. This requirement is crucial for battery-powered devices with limited resources, such as autonomous remote sensors or implants. Well-known and popular encryption techniques are frequently too expensive. This problem is on the increase as machine-to-machine communication and the Internet of Things are becoming a reality. Therefore, there is growing demand for finding trade-offs between security, cost and performance in lightweight cryptography. This article discusses asymmetric numeral systems— an innovative approach to entropy coding which can be used for compression with encryption. It provides a compression ratio comparable with arithmetic coding at a similar speed as Huffman coding; hence, this coding is starting to replace them in new compressors. Additionally, by perturbing its coding tables, the asymmetric numeral system makes it possible to simultaneously encrypt the encoded message at nearly no additional cost. The article introduces this approach and analyzes its security level. The basic application is reducing the number of rounds of some cipher used on ANS-compressed data, or completely removing an additional encryption layer when reaching a satisfactory protection level.

As the Internet of Things (IoT) continues to revolutionize value-added services, its conventional architecture exhibits persistent scalability and security vulnerabilities, jeopardizing the trustworthiness of IoT-based services. These architectural limitations hinder the IoT’s Sensor-as-a-Service (SEaaS) model, which enables the commercial transmission of sensed data through cloud platforms. This study proposes an innovative computational framework that integrates decentralized blockchain technology into the IoT architectural design, specifically enhancing SEaaS efficiency. This research contributes to an optimized IoT architecture with decentralized blockchain operations and simplified public key encryption. Furthermore, this study introduces an advanced SEaaS model featuring innovative trading operations for sensed data among diverse stakeholders. At its core, this model presents a unique blockchain-based data-sharing mechanism that manages multiple aspects, from enrollment to validation. Evaluations conducted in a standard Python environment indicate that the proposed SEaaS model outperforms existing blockchain-based data-sharing models, demonstrating approximately 40% less energy consumption, 18% increased throughput, 16% reduced latency, and a 25% reduction in algorithm processing time. Ultimately, integrating a lightweight authentication mechanism using simplified public key cryptography within the blockchain establishes the model’s potential for efficient and secure data-sharing in IoT.

Cryptographic devices’ complexity necessitates fast security simulation environments against fault attacks. SystemC, a promising candidate in Electronic System Levels (ESLs), can achieve higher simulation speeds while maintaining accuracy and reliability, and its modular and hierarchical design allows for efficient modeling of complex cryptographic algorithms and protocols. However, code modification is required for fault injection and detection. Aspect-Oriented Programming (AOP) can test cryptographic models’ robustness without modifications, potentially replacing real cryptanalysis schemes and reducing the time and effort required for fault injection and detection. Through the utilization of a fault injection/detection environment, this paper presents a novel approach to simulating the security fault attacks of ASCON cryptographic systems at the ESL. The purpose of this methodology is to evaluate the resistance of ASCON SystemC models against fault attacks. The proposed methodology leverages the advantages of AOP to enhance the fault injection and detection process. By applying AOP techniques, we inject faults into the SystemC models without making any changes to the main codebase. This approach not only improves the efficiency of testing cryptographic systems but also ensures that the main functionality remains intact during the fault injection process. The methodology was validated using three scenarios and SystemC ASCON as a case study. The first simulation involved evaluating fault detection capabilities, the second focused on the impact of AOP on executable file size and simulation time, and the third focused on the ESL impact on the ASCON design process. Simulation results show that this methodology can perfectly evaluate the robustness of the ASCON design against fault injection attacks with no significant impact on simulation time and file executable size. Additionally, the simulation results prove that the ASCON development life cycle at the ESL reduces the amount of time devoted to the design procedure by 83.34%, and the ASCON security attack simulations at the ESL decrease the simulation time by 40% compared to the register transfer level (RTL).

This article presents a new hybrid method (combining search based methods and direct construction methods) to generate all $4 \times 4$4×4 involutory maximum distance separable (MDS) matrices over $\mathbf{F}_{2^m}$F2m . The proposed method reduces the search space complexity at the level of $$\sqrt n $$ n, where n represents the number of all $4 \times 4$4×4 invertible matrices over $\mathbf{F}_{2^m}$F2m to be searched for. Hence, this enables us to generate all $4 \times 4$4×4 involutory MDS matrices over $\mathbf{F}_{2^3}$F23 and $\mathbf{F}_{2^4}$F24 . After applying global optimization technique that supports higher Exclusive-OR (XOR) gates (e.g., XOR3, XOR4) to the generated matrices, to the best of our knowledge, we generate the lightest involutory/non-involutory MDS matrices known over $\mathbf{F}_{2^3}$F23 , $\mathbf{F}_{2^4}$F24 and $\mathbf{F}_{2^8}$F28 in terms of XOR count. In this context, we present new $4 \times 4$4×4 involutory MDS matrices over $\mathbf{F}_{2^3}$F23 , $\mathbf{F}_{2^4}$F24 and $\mathbf{F}_{2^8}$F28 , which can be implemented by 13 XOR operations with depth 5, 25 XOR operations with depth 5 and 42 XOR operations with depth 4, respectively. Finally, we denote a new property of Hadamard matrix, i.e., (involutory and MDS) Hadamard matrix form is, in fact, a representative matrix form that can be used to generate a small subset of all $2^k\times 2^k$2k×2k involutory MDS matrices, where k > 1. For k = 1, Hadamard matrix form can be used to generate all involutory MDS matrices.

We introduce the QARMAv2 family of tweakable block ciphers. It is a redesign of QARMA (from FSE 2017) to improve its security bounds and allow for longer tweaks, while keeping similar latency and area. The wider tweak input caters to both specific use cases and the design of modes of operation with higher security bounds. This is achieved through new key and tweak schedules, revised S-Box and linear layer choices, and a more comprehensive security analysis. QARMAv2 offers competitive latency and area in fully unrolled hardware implementations. Some of our results may be of independent interest. These include: new MILP models of certain classes of diffusion matrices; the comparative analysis of a full reflection cipher against an iterative half-cipher; our boomerang attack framework; and an improved approach to doubling the width of a block cipher.

Lightweight cryptographic algorithms must develop to ensure the confidentiality and integrity of the data in resource-constrained devices. Keys are vital to every cryptography algorithm because they provide randomness, complexity, unexpected nature, and robustness. A light encryption device (LED) is considered a lighter version of advanced encryption standard (AES), but it is vulnerable to related key attacks due to using the same key during the whole encryption process. This paper presents a hybrid chaotic key generator (HCKG) based on 3D Lorenz, and 2D Henon maps to generate a highly randomized key that combines with the LED to provide a high level of secure encryption on resource-constrained devices. We modified the HCKG every four rounds via simple operations to get the subkeys and XORed it with the state to increase the complexity of the ciphertext. Moreover, the HCKG with subkeys allows us to decrease the total number of LED rounds from 32 to 24 to minimize the calculation cost while maintaining a high level of security. National Institute of Science and Technology (NIST) test suite proves that the proposed LED-HCKG demonstrates a high-performance increase by nearly 0.3283 higher than LED concerning data integrity and secrecy. [ABSTRACT FROM AUTHOR]

In medical information systems, image data can be considered crucial information. As imaging technology and methods for analyzing medical images advance, there will be a greater wealth of data available for study. Hence, protecting those images is essential. Image encryption methods are crucial in multimedia applications for ensuring the security and authenticity of digital images. Recently, the encryption of medical images has garnered significant attention from academics due to concerns about the safety of medical communication. Advanced approaches, such as e-health, smart health, and telemedicine applications, are employed in the medical profession. This has highlighted the issue that medical images are often produced and shared online, necessitating protection against unauthorized use. [ABSTRACT FROM AUTHOR]

The Internet of Things is gaining popularity throughout the world. With the growth of digital communication, healthcare 4.0 are being implemented by many businesses industry in order to establish a more resilient, competent, and intelligent smart healthcare system. Healthcare monitoring services are the part of smart healthcare system. These types of monitoring systems are mainly based on the Internet of Things (IoT). IoT helps to integrate multiple sensors and objects that can directly communicate with each other without human intervention. This type of IoT based systems are vulnerable to different adversarial threats such as cloning attack, impersonation attack etc. Hence medical IoT device authentication is essential in smart healthcare to verify user legitimacy. One way to verify user legitimacy is using physical unclonable function (PUF). The PUF protects sensor nodes from tampering, cloning attack. In this paper, we have proposed a lightweight PUF based authentication mechanism for embedded IoT devices in e-healthcare system. The proposed authentication technique helps to authenticate IoT sensor nodes which are responsible for transmitting sensitive health data in a health monitoring system. The performance comparison shows that the protocol is efficient with high through put and low computational load. The security analysis of the authentication scheme shows it would resist different types of network attacks. The proposed authentication provides a facility that no one except that the primary users can have access to the raw challenge response pair of integrated PUF circuits so that adversary will unable to build another same PUF model. Also the success probability is 2 - 76 for recovering the transformed 128 bit challenge and responses. [ABSTRACT FROM AUTHOR]