With the exponential growth in Internet-of-Things (IoT) devices, security and privacy issues have emerged as critical challenges that can potentially compromise their successful deployment in many data-sensitive applications. Hence, there is a pressing need to address these challenges, given that IoT systems suffer from different limitations, and IoT devices are constrained in terms of energy and computational power, which renders them extremely vulnerable to attacks. Traditional cryptographic algorithms use a static structure that requires several rounds of computations, which leads to significant overhead in terms of execution time and computational resources. Moreover, the problem is compounded when dealing with multimedia contents, since the associated algorithms have stringent QoS requirements. In this paper, we propose a lightweight cipher algorithm based on a dynamic structure with a single round that consists of simple operations, and that targets multimedia IoT. In this algorithm, a dynamic key is generated and then used to build two robust substitution tables, a dynamic permutation table, and two pseudo-random matrices. This dynamic cipher structure minimizes the number of rounds to a single one, while maintaining a high level of randomness and security. Moreover, the proposed cipher scheme is flexible as the dimensions of the input matrix can be selected to match the devices' memory capacity. Extensive security tests demonstrated the robustness of the cipher against various kinds of attacks. The speed, simplicity and high-security level, in addition to low error propagation, make of this approach a good encryption candidate for multimedia IoT devices.
The protection of multimedia content has become a key area of research, since very often a user's privacy and confidentiality can be at risk. Although a large number of image encryption algorithms have recently emerged, only a subset of these algorithms are suitable for real applications. These algorithms however use non-integer operations such as chaotic solutions that introduce a sizeable overhead in terms of latency and resources, in addition to floating-point hardware that is costly to implement. Designing an efficient, lightweight, and secure image encryption algorithm is still a hard challenge; yet, it is crucial to have in order to meet the demands of recent multimedia applications running on energy-limited devices. In this paper, an efficient image encryption scheme based on a dynamic structure is proposed. The structure of the proposed cipher consists of two different lightweight rounds (forward and backward chaining blocks) and a block permutation process. In addition, a key derivation function is proposed to produce a dynamic key based on a secret key and a nonce. This key, according to its configuration, can be changed for each validate time (session) or for each new input image. Then, based on this key, the cipher layers are produced, which are an integer or a binary diffusion matrix and a substitution table S-box, together with a permutation table P-box. The proposed dynamic cipher is designed to provide high robustness against contemporary powerful attacks, and permits reducing the required number of rounds for achieving the lightweight property. Experimental simulations demonstrate the efficiency and robustness levels of the proposed scheme.
Intelligent Transportation Systems (ITS), the heart of the new revolution of smart transport, has evolved from the well-known Vehicular Ad-hoc Networks (VANETs) to become the Internet of Vehicles (IoV). In fact, the increase in the number of vehicles and the newly born technologies have stimulated the new Internet of Vehicles (IoV) or the Internet of Cars. In general, ITS aims at ensuring better traffic efficiency and reducing road accidents. However, due to different limitations and issues, these systems suffer from different security and privacy vulnerabilities. In fact, they are both vulnerable to various types of security and privacy attacks that may result in life-endangering situations. As a result, several solutions were presented to achieve the required levels of security and confidentiality. In this paper, an overview of ITS is presented stating the reasons behind the evolution from Vanet to IoV. Then, the main threats/attacks that threaten ITS are classified according to their (1) security impact and according to the (2) network layer(s) they affect. Solutions for each attack are also well presented. In addition, a security and performance evaluation and summary tables are presented to provide an overview of these surveyed solutions.
New dangerous attacks have arisen as we witness the current evolution of digital data. Connecting devices, vehicles, even our own bodies to the Internet have generated enormous amounts of data that need to be secured. New security solutions and ciphers are being proposed taking into consideration all the limitations in the devices used in today's technologies. However, different factors have to be taken into consideration to prove the reliability of any cipher. One of these criteria is the randomness of the ciphered output. Usually, randomness tests are used to prove the efficiency of Pseudo Random Number Generators-PRNGs, and they are not considered in the test suite for cryptographic algorithms. This paper proposes using the well known tools Practrand [8] and TestU01 [18] to test the randomness criteria for any new/old symmetric cipher. To show our cryptographic point of view, several well known ciphers were tested by these tools. Some of them failed these tests and did not meet the desired security requirements and the sufficient statistical immunity. In fact, this paper shows that these ciphers do not generate enough randomness making them vulnerable to different kinds of attacks which reinforces our proposal.
Protecting the contents of medical records is of paramount importance when it comes to preserving patients' privacy. Most existing cryptographic-based solutions rely on traditional encryption algorithms having a multi-round structure, which introduces processing latency and requires increased resources. Medical images possess special characteristics compared to other types of images. The main goal of this paper is to leverage these characteristics to design and implement an efficient and secure encryption algorithm for such images. The proposed solution defines three variants of encryption algorithms: (a) full, (b) middlefull, and (c) selective. The full approach encrypts all sub-matrices of an image, while the middle-full variant is a middle solution between the selective and full algorithms and its goal is to just hide the type of the medical image. Selective encryption identifies a set of sub-matrices of an image according to a statistical average test, known as region of interest (ROI). In the three approaches, a high security level is ensured since each image is encrypted independently of the previous and next images. Also, all primitives of the proposed cipher, such as permutation and substitution, depend on a dynamic key. Furthermore, the encryption scheme is efficient since the proposed round function is lightweight and applied for only one round. This reduces the latency and the required resources as compared to traditional cryptographic schemes. The proposed approach is flexible as it can be applied in either selective, middle-full, or full mode. Also, the size of a sub-matrix is variable and can be changed according to the available memory size. Several security and performance tests are conducted to evaluate the effectiveness of the proposed solution. The results validate the robustness of the proposed scheme against almost all considered types of attacks and show an improvement in terms of latency and resources compared to current image-encryption schemes. Also, the results confirm the robustness of the proposed algorithm in protecting the contents of medical images.
Lightweight cryptography (LWC) is an interesting research area in the field of information security. Some limitations like: increased components usage, time consumption, power consumption and memory requirement mandate the need for lightweight cryptography. One of the proposed algorithms in this field is Speck which was designed by the National Security Agency (NSA) in June 2013. In this paper, we propose a new ultra-lightweight cryptographic algorithm based on Speck known as Speck-R. Speck-R is a hybrid cipher, combining ARX architecture with a dynamic substitution layer. The novelty in this paper resides in adding a key-dynamic substitution layer that changes according to a dynamic key. With this modification, the number of rounds can be reduced from 26 (in Speck) to 7 (in Speck-R). Thus, the main contribution of this paper consists in reducing the execution time of Speck by at least 18% on limited devices to reach a reduction of 77% while keeping a high level of security. To backbone Speck-R's security, different security and statistical tests are exerted on Speck-R. In addition, a real hardware implementation on three different famous IoT devices is also presented where Speck-R outperformed Speck in terms of execution times. Finally, extensive tests show that Speck-R possesses the necessary criteria to be considered as a good cipher scheme that is suitable for lightweight devices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.