Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Lightweight Encryption Cipher.
Artykuły w czasopismach na temat „Lightweight Encryption Cipher”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Lightweight Encryption Cipher”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.
1
Mishra, Girish, S. K. Pal, S. V. S. S. N. V. G. Krishna Murthy, Kanishk Vats i Rakshak Raina. "Distinguishing Lightweight Block Ciphers in Encrypted Images". Defence Science Journal 71, nr 5 (2.09.2021): 647–55. http://dx.doi.org/10.14429/dsj.71.16843.
Pełny tekst źródłaStreszczenie:
Modern day lightweight block ciphers provide powerful encryption methods for securing IoT communication data. Tiny digital devices exchange private data which the individual users might not be willing to get disclosed. On the other hand, the adversaries try their level best to capture this private data. The first step towards this is to identify the encryption scheme. This work is an effort to construct a distinguisher to identify the cipher used in encrypting the traffic data. We try to establish a deep learning based method to identify the encryption scheme used from a set of three lightweight block ciphers viz. LBlock, PRESENT and SPECK. We make use of images from MNIST and fashion MNIST data sets for establishing the cryptographic distinguisher. Our results show that the overall classification accuracy depends firstly on the type of key used in encryption and secondly on how frequently the pixel values change in original input image.
2
Matheis, Kenneth, Rainer Steinwandt i Adriana Suárez Suárez Corona. "Algebraic Properties of the Block Cipher DESL". Symmetry 11, nr 11 (15.11.2019): 1411. http://dx.doi.org/10.3390/sym11111411.
Pełny tekst źródłaStreszczenie:
The Data Encryption Standard Lightweight extension (DESL) is a lightweight block cipher which is very similar to DES, but unlike DES uses only a single S-box. This work demonstrates that this block cipher satisfies comparable algebraic properties to DES—namely, the round functions of DESL generate the alternating group and both ciphers resist multiple right-hand sides attacks.
3
Kim, Hyunjun, Siwoo Eum, Wai-Kong Lee, Sokjoon Lee i Hwajeong Seo. "Secure and Robust Internet of Things with High-Speed Implementation of PRESENT and GIFT Block Ciphers on GPU". Applied Sciences 12, nr 20 (11.10.2022): 10192. http://dx.doi.org/10.3390/app122010192.
Pełny tekst źródłaStreszczenie:
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.
4
Sayyed, Karishma Shaukat, Prof S. R. Ganolkar i Prof S. O. Rajankar. "FPGA Implementation of Rectangle Lightweight Block Cipher". International Journal for Research in Applied Science and Engineering Technology 10, nr 5 (31.05.2022): 2426–33. http://dx.doi.org/10.22214/ijraset.2022.42143.
Pełny tekst źródłaStreszczenie:
Abstract: Block ciphers are basic building blocks for network security. In recent years, designing a lightweight block cipher is the main goal of VLSI design engineers. In this paper, we have designed and verified the functionality of the RECTANGLE block cipher which is one of the lightweight block cipher using Modelsim simulator and implemented using Intel Quartus Prime 18.0 FPGA device. Using the bit-slice technique a RECTANGLE block cipher allows lightweight and fast implementations. The en-cryption architecture has two parts one is round transformation and the other is key scheduling. RECTANGLE uses Substitution-Permutation network. It takes 64-bit plain text and an 80-bit key as an input and converts it into a 64-bit ciphertext. There are three main advantages of using the RECTANGLE block cipher. First, it has a simple design. Second, it is very hardware friendly. By selecting the proper S-block RECTANGLE can achieve good security performance. Index Terms: Lightweight Block Cipher, Block Ciphers, Encryption, Bit-slice technique, Round Transformation, Key Scheduling, Substitution Block, Permutation Block.
5
Zakaria, Abdul Alif, Azni Haslizan Ab Halim, Farida Ridzuan, Nur Hafiza Zakaria i Maslina Daud. "LAO-3D: A Symmetric Lightweight Block Cipher Based on 3D Permutation for Mobile Encryption Application". Symmetry 14, nr 10 (30.09.2022): 2042. http://dx.doi.org/10.3390/sym14102042.
Pełny tekst źródłaStreszczenie:
Data transmissions between smartphone users require security solutions to protect communications. Hence, encryption is an important tool that must be associated with smartphones to keep the user’s data safe. One proven solution to enhance the security of encryption algorithms is by using 3D designs on symmetric block ciphers. Although a 3D cipher design could improve the algorithms, the existing methods enlarge the block sizes that will also expand the key sizes and encryption rounds, thus decreasing their efficiency. Therefore, we propose the LAO-3D block cipher using a 3D permutation that offers security by providing confusion and diffusion characteristics. Five security analyses were conducted to assess the strengths of LAO-3D. The findings suggest that LAO-3D achieves better results compared to other existing lightweight block ciphers, with 98.2% non-linearity, 50% bit error rates for both plaintext and key modifications, surpasses 100% of the randomness test, and is immune to differential and linear cryptanalysis attacks. Moreover, the block cipher obtains competitive performance results in software applications. From the security analyses and performance tests, it is proven that LAO-3D can provide sufficient security at low costs in mobile encryption applications.
6
Wang, Juan, i Qun Ding. "Dynamic Rounds Chaotic Block Cipher Based on Keyword Abstract Extraction". Entropy 20, nr 9 (11.09.2018): 693. http://dx.doi.org/10.3390/e20090693.
Pełny tekst źródłaStreszczenie:
According to the keyword abstract extraction function in the Natural Language Processing and Information Retrieval Sharing Platform (NLPIR), the design method of a dynamic rounds chaotic block cipher is presented in this paper, which takes into account both the security and efficiency. The cipher combines chaotic theory with the Feistel structure block cipher, and uses the randomness of chaotic sequence and the nonlinearity of chaotic S-box to dynamically generate encrypted rounds, realizing more numbers of dynamic rounds encryption for the important information marked by NLPIR, while less numbers of dynamic rounds encryption for the non-important information that is not marked. Through linear and differential cryptographic analysis, ciphertext information entropy, “0–1” balance and National Institute of Science and Technology (NIST) tests and the comparison with other traditional and lightweight block ciphers, the results indicate that the dynamic variety of encrypted rounds can achieve different levels of encryption for different information, which can achieve the purpose of enhancing the anti-attack ability and reducing the number of encrypted rounds. Therefore, the dynamic rounds chaotic block cipher can guarantee the security of information transmission and realize the lightweight of the cryptographic algorithm.
7
Antal, Eugen, i Viliam Hromada. "A NEW STREAM CIPHER BASED ON FIALKA M-125". Tatra Mountains Mathematical Publications 57, nr 1 (1.11.2013): 101–18. http://dx.doi.org/10.2478/tmmp-2013-0038.
Pełny tekst źródłaStreszczenie:
ABSTRACT In 2010, a new cipher Hummingbird by [Engels, D.-Fan, X.- -Gong, G.-Hu, H.-Smith, E. M. Hummingbird: Ultra-Lightweight Cryptography for Resource-Constrained Devices, in: 1st International Workshop on Lightweight Cryptography for Resource-Constrained Devices. Tenerife, Canary Islands, Spain, January 2010] was proposed. It is a combination of both block and stream cipher and its design was inspired and motivated by the Enigma machine. The encryption process of the cipher can be considered as a continuous running of a rotor-cipher. Four block ciphers play the role of the rotors that apply the permutation to the 16-bit words. This cipher motivated us to investigate a new cipher design based on a Fialka cipher machine. Fialka M-125 is an Enigma based rotor-cipher machine used during the Cold War. It is considered one of the most secure cipher machines. Advantages of this cipher are based on the elimination of the Enigma’s known weaknesses. There are no known attacks on this cipher. In this paper we introduce a new cipher based on the Fialka machine. We transform the Fialka encryption algorithm to a modern stream cipher. The rotors are represented as S-boxes and shift registers are used to provide the rotor clocking. We propose three different versions of the cipher and investigate the statistical properties of their outputs. In the article we also provide basic implementation details and basic performance analysis.
8
Zhang, Ping, i Qian Yuan. "Minimizing Key Materials: The Even–Mansour Cipher Revisited and Its Application to Lightweight Authenticated Encryption". Security and Communication Networks 2020 (10.03.2020): 1–6. http://dx.doi.org/10.1155/2020/4180139.
Pełny tekst źródłaStreszczenie:
The Even–Mansour cipher has been widely used in block ciphers and lightweight symmetric-key ciphers because of its simple structure and strict provable security. Its research has been a hot topic in cryptography. This paper focuses on the problem to minimize the key material of the Even–Mansour cipher while its security bound remains essentially the same. We introduce four structures of the Even–Mansour cipher with a short key and derive their security by Patarin’s H-coefficients technique. These four structures are proven secure up to O˜2k/μ adversarial queries, where k is the bit length of the key material and μ is the maximal multiplicity. Then, we apply them to lightweight authenticated encryption modes and prove their security up to about minb/2,c,k−log μ-bit adversarial queries, where b is the size of the permutation and c is the capacity of the permutation. Finally, we leave it as an open problem to settle the security of the t-round iterated Even–Mansour cipher with short keys.
9
Fan, Ting, Lingchen Li, Yongzhuang Wei i Enes Pasalic. "Differential cryptanalysis of full-round ANU-II ultra-lightweight block cipher". International Journal of Distributed Sensor Networks 18, nr 9 (wrzesień 2022): 155013292211193. http://dx.doi.org/10.1177/15501329221119398.
Pełny tekst źródłaStreszczenie:
Lightweight ciphers are often used as the underlying encryption algorithm in resource-constrained devices. Their cryptographic security is a mandatory goal for ensuring the security of data transmission. Differential cryptanalysis is one of the most fundamental methods applicable primarily to block ciphers, and the resistance against this type of cryptanalysis is a necessary design criterion. ANU-II is an ultra-lightweight block cipher proposed in 2017, whose design offers many advantages such as the use of fewer hardware resources (logic gates), low power consumption and fast encryption for Internet of Things devices. The designers of ANU-II claimed its resistance against differential cryptanalysis and postulated that the design is safe enough for Internet of Things devices. However, as addressed in this article, the security claims made by designers appear not to be well grounded. Using mixed-integer linear programming–like techniques, we identify one-round differential characteristic that holds with probability 1, which is then efficiently employed in mounting the key recovery attack on full-round ANU-II with only 22 chosen plaintexts and 262.4 full-round encryptions. The result shows that the designers’ security evaluation of ANU-II against differential cryptanalysis is incorrect and the design rationale is flawed. To remedy this weakness, we provide an improved variant of ANU-II, which has much better resistance to differential cryptanalysis without affecting the hardware and/or software implementation cost.
10
Al-Omari, A. H. "Lightweight Dynamic Crypto Algorithm for Next Internet Generation". Engineering, Technology & Applied Science Research 9, nr 3 (8.06.2019): 4203–8. http://dx.doi.org/10.48084/etasr.2743.
Pełny tekst źródłaStreszczenie:
Modern applications, especially real time applications, are hungry for high-speed end-to-end transmission which usually conflicts with the necessary requirements of confidential and secure transmission. In this work, a relatively fast, lightweight and attack-resistant crypto algorithm is proposed. The algorithm is a symmetric block cipher that uses a secure pre-shared secret as the first step. Then, a dynamic length key is generated and inserted inside the cipher text. Upon receiving the cipher text, the receiver extracts the key from the received cipher text to decrypt the message. In this algorithm, ciphering and deciphering are mainly based on simple XoR operations followed by substitutions and transpositions in order to add more confusion and diffusion to the algorithm. Experimental results show faster encryption/decryption time when compared to known encryption standards.
11
Zhang, Xing, Jian Chen, Tianning Li, Gang Dai i Changda Wang. "LILP: A Lightweight Enciphering Algorithm to Encrypt Arbitrary-Length Messages". Symmetry 15, nr 1 (7.01.2023): 177. http://dx.doi.org/10.3390/sym15010177.
Pełny tekst źródłaStreszczenie:
The advancement of the Internet of Things (IoT) has promoted the development of embedded devices. It is important to ensure data transmission security on embedded devices with limited computing power and storage space. However, the traditional block encryption algorithm cannot run efficiently on embedded devices because of the large amount of computation. In this paper, a lightweight length-preserving-encryption algorithm (LILP) is proposed to convert an n-bit block cipher into a special block cipher that supports an arbitrary length of no less than 2n bits as input. LILP adopts the involution design method based on a Lai–Massey structure and lightweight components to adapt to the limited computing power of embedded devices. In particular, a lightweight compression function (LCF) is designed to process the data during iteration, which improves security without reducing the efficiency of the algorithm. The experimental results show that LILP is more efficient than traditional similar algorithms in encrypting data for resource-constrained devices while ensuring data security in the IoT.
12
A. Baker, Shatha, i Ahmed S. Nori. "Comparison of the Randomness Analysis of the Modified Rectangle Block Cipher and Original algorithm". NTU Journal of Pure Sciences 1, nr 2 (31.05.2022): 10–21. http://dx.doi.org/10.56286/ntujps.v1i2.185.
Pełny tekst źródłaStreszczenie:
In recent years, different encryption lightweight algorithms have been suggested to protect the security of data transferred across the IoT network. The symmetric key ciphers play a significant role in the security of devices, in particular block ciphers. the RECTANGLE algorithm amongst the current lightweight algorithms. Rectangle algorithm does have good encryption efficacy but the characteristics of confusion and diffusion that a cipher needed are lacking from this algorithm. Therefore, by improving the algorithm confusion and diffusion properties, we expanded Rectangle utilizing a 3D cipher and modified the key scheduling algorithm. To assess if these two algorithms are random or not, randomness analysis was done by using the NIST Statistical Test Suite. To create 100 samples for each algorithm, nine distinct data categories were used. These algorithms created ciphertext blocks, which were then concatenated to form a binary sequence. NIST tests carried out under 1% significance level. According to the results of the comparison study, the proposed algorithm's randomness analysis results are gave 27.48% better results than the original algorithm.
13
Bansod, Gaurav, Narayan Pisharoty i Abhijit Patil. "PICO : An Ultra Lightweight and Low Power Encryption Design for Ubiquitous Computing". Defence Science Journal 66, nr 3 (25.04.2016): 259. http://dx.doi.org/10.14429/dsj.66.9276.
Pełny tekst źródłaStreszczenie:
<div>An ultra-lightweight, a very compact block cipher ‘PICO’ is proposed. PICO is a substitution and permutation based network, which operates on a 64 bit plain text and supports a key length of 128 bits. It has a compact structure and requires 1877 GEs. Its innovative design helps to generate a large number of active S - boxes in fewer rounds which can thwart the linear and differential attacks on the cipher. PICO shows good performance on both the hardware and the software platforms. PICO consumes only 2504 bytes of Flash memory which is less than the ultra-lightweight cipher PRESENT. PICO has a very strong substitution layer (S-box) which not only makes the design robust but also introduces a great avalanche effect. PICO has a strong and compact key scheduling which is motivated by the latest cipher SPECK designed by NSA. PICO consumes 28 mW of dynamic power which is less than the PRESENT cipher (38 mW). The security analysis of PICO and its performance as an ultra-lightweight cipher are presented. </div><!--[endif]-->
14
Prathiba, A., Suyash Vardhan Srivathshav, Ramkumar P. E., Rajkamal E. i Kanchana Bhaaskaran V. S. "Lightweight VLSI Architectures for Image Encryption Applications". International Journal of Information Security and Privacy 16, nr 1 (styczeń 2022): 1–23. http://dx.doi.org/10.4018/ijisp.291700.
Pełny tekst źródłaStreszczenie:
Lightweight cryptography offers significant security service in constrained environments such as wireless sensor networks and Internet of Things. The focus of this article is to construct lightweight SPN block cipher architectures with substitution box based on finite fields. The paper also details the FPGA implementation of the lightweight symmetric block cipher algorithm of SPN type with combinational S-box. Restructuring of traditional look-up-table Substitution Box (S-Box) sub-structure with a combinational logic S-box is attempted. Elementary architectures namely the basic round architecture and reduced datawidth architecture incorporating look-up-table and combinational S-Box substructure are compared in terms of area and throughput. Proposed restructure mechanism occupies less FPGA resources with no comprise in the latency and also demonstrates performance efficiency and low power consumption in Xilinx FPGAs. Robustness of the proposed method against various statistical attacks has been analyzed through comparison with other existing encryption mechanisms.
15
Damodharan, Jamunarani, Emalda Roslin Susai Michael i Nasir Shaikh-Husin. "High Throughput PRESENT Cipher Hardware Architecture for the Medical IoT Applications". Cryptography 7, nr 1 (6.02.2023): 6. http://dx.doi.org/10.3390/cryptography7010006.
Pełny tekst źródłaStreszczenie:
The Internet of Things (IoT) is an intelligent technology applied to various fields like agriculture, healthcare, automation, and defence. Modern medical electronics is also one such field that relies on IoT. Execution time, data security, power, and hardware utilization are the four significant problems that should be addressed in the data communication system between intelligent devices. Due to the risks in the implementation algorithm complexity, certain ciphers are unsuitable for IoT applications. In addition, IoT applications are also implemented on an embedded platform wherein computing resources and memory are limited in number. Here in the research work, a reliable lightweight encryption algorithm with PRESENT has been implemented as a hardware accelerator and optimized for medical IoT-embedded applications. The PRESENT cipher is a reliable, lightweight encryption algorithm in many applications. This paper presents a low latency 32-bit data path of PRESENT cipher architecture that provides high throughput. The proposed hardware architecture has been implemented and tested with XILINX XC7Z030FBG676-2 ZYNQ FPGA board 7000. This work shows an improvement of about 85.54% in throughput with a reasonable trade-off over hardware utilization.
16
Ding, Lina, Chunyuan Liu, Yanpeng Zhang i Qun Ding. "A New Lightweight Stream Cipher Based on Chaos". Symmetry 11, nr 7 (2.07.2019): 853. http://dx.doi.org/10.3390/sym11070853.
Pełny tekst źródłaStreszczenie:
A chaotic system and two Nonlinear Feadback Shift Registers (NFSRs) are used to generate a new stream cipher in this paper. This design can be used for efficient encryption in resource-constrained devices or environments. The chaotic system is quantified and integrated with two NFSRs based on the technology of Field Programmable Gate Array (FPGA). Many analyses are made from the angle of entropy in order to verify the cryptographic characteristics of the stream cipher, and National Institute of Standards and Technology (NIST) statistical test is completed to analyze the cipher. The test results show that the stream cipher here has good cryptographic characteristics.
17
Mohammad Shah, Isma Norshahila, Eddie Shahril Ismail, Faieza Samat i Normahirah Nek Abd Rahman. "Modified Generalized Feistel Network Block Cipher for the Internet of Things". Symmetry 15, nr 4 (12.04.2023): 900. http://dx.doi.org/10.3390/sym15040900.
Pełny tekst źródłaStreszczenie:
With the advent of the Internet-of-Things (IoT) technologies, millions of low-resource devices are constantly used at the network’s edge. As a result, the large amount of private and sensitive data generated by these devices must be securely transported, stored, and processed, posing a challenge because these resource-constrained IoT devices cannot meet the criteria of conventional encryption ciphers. Due to this limitation on IoT-enabled devices, lightweight cryptography has emerged as a new area of study. Lightweight block ciphers, a subfield of lightweight cryptography, include the substitution–permutation network (SPN) and Feistel-based networks. Feistel networks are further divided into two types: classical Feistel networks and generalized Feistel networks (GFN). While classical Feistel ciphers divide a message into two sub-blocks, GFN divides a message into k sub-blocks for some k > 2 called the partition number. One popular form of GFN is the so-called Type-II. Unfortunately, this type of Feistel structure needs a large number of rounds to obtain a full diffusion property. A full diffusion means all output sub-blocks are affected by all input sub-blocks. Therefore, this paper proposed a new lightweight block cipher by modifying the GFN structure, focusing on providing optimal security to the cipher with a small number of rounds. The algorithm was subjected to a series of statistical and cryptographic randomization analyses in order to investigate the avalanche effect on the ciphertext and the algorithm’s random properties, such as confusion, diffusion, and independence. The avalanche criterion and output randomness results show that this algorithm meets the fundamental security requirement for a lightweight block cipher.
18
Ghorashi, Seyed, Tanveer Zia, Yinhao Jiang i Michael Bewong. "Software Optimisation of Lightweight Klein Encryption in the Internet of Things". Journal of Information Security and Cybercrimes Research 4, nr 2 (30.12.2021): 159–72. http://dx.doi.org/10.26735/pxae9280.
Pełny tekst źródłaStreszczenie:
The Internet of Things (IoT) and Wireless Sensor Network (WSN) devices are prone to security vulnerabilities, especially when they are resource constrained. Lightweight cryptography is a promising encryption concept for IoT and WSN devices, that can mitigate these vulnerabilities. For example, Klein encryption is a lightweight block cipher, which has achieved popularity for the trade-off between performance and security. In this paper, we propose one novel method to enhance the efficiency of the Klein block cipher and the effects on the Central Processing Unit (CPU), memory usage, and processing time. Furthermore, we evaluated another approach on the performance of the Klein encryption iterations. These approaches were implemented in the Python language and ran on the Raspberry PI 3. We evaluated and analysed the results of two modified encryption algorithms and confirm that two enhancing techniques lead to significantly improved performance compared to the original algorithm.
19
Maolood, Abeer Tariq, Ekhlas Khalaf Gbashi i Eman Shakir Mahmood. "Novel lightweight video encryption method based on ChaCha20 stream cipher and hybrid chaotic map". International Journal of Electrical and Computer Engineering (IJECE) 12, nr 5 (1.10.2022): 4988. http://dx.doi.org/10.11591/ijece.v12i5.pp4988-5000.
Pełny tekst źródłaStreszczenie:
<span lang="EN-US">In the recent years, an increasing demand for securing visual resource-constrained devices become a challenging problem due to the characteristics of these devices. Visual resource-constrained devices are suffered from limited storage space and lower power for computation such as wireless sensors, internet protocol (IP) camera and smart cards. Consequently, to support and preserve the video privacy in video surveillance system, lightweight security methods are required instead of the existing traditional encryption methods. In this paper, a new light weight stream cipher method is presented and investigated for video encryption based on hybrid chaotic map and ChaCha20 algorithm. Two chaotic maps are employed for keys generation process in order to achieve permutation and encryption tasks, respectively. The frames sequences are encrypted-decrypted based on symmetric scheme with assist of ChaCha20 algorithm. The proposed lightweight stream cipher method has been tested on several video samples to confirm suitability and validation in term of encryption–decryption procedures. The performance evaluation metrics include visual test, histogram analysis, information entropy, correlation analysis and differential analysis. From the experimental results, the proposed lightweight encryption method exhibited a higher security with lower computation time compared with state-of-the-art encryption methods.</span>
20
Guang, Yerui, Longfei Yu, Wenjie Dong, Ya Wang, Jian Zeng, Jiayu Zhao i Qun Ding. "Chaos-Based Lightweight Cryptographic Algorithm Design and FPGA Implementation". Entropy 24, nr 11 (4.11.2022): 1610. http://dx.doi.org/10.3390/e24111610.
Pełny tekst źródłaStreszczenie:
With the massive application of IoT and sensor technologies, the study of lightweight ciphers has become an important research topic. In this paper, an effective lightweight LZUC (lightweight Zu Chongzhi) cipher based on chaotic system is proposed to improve the traditional ZUC algorithm. In this method, a further algorithm is designed for the process of integrating chaos into the lightweighting of ZUC. For the first time, this design introduces the logistic chaotic system into both the LFSR (linear feedback shift register) and nonlinear F-function of the cryptographic algorithm. The improved LZUC algorithm not only achieves a certain effect in lightweighting, but also has good statistical properties and security of the output sequence. To verify the performance of the LZUC cipher, we performed NIST statistical tests and information entropy analysis on its output key streams and discussed the typical attacks on the algorithm’s resistance to weak key analysis, guess–determination analysis, time–stored data trade-off analysis, and algebraic analysis. In addition, we completed the design of an image security system using the LZUC cipher. Histogram analysis and correlation analysis are used to analyze both plaintext and ciphertext data. At the end of the article, the plaintext and ciphertext images displayed by LCD can be further visualized to verify the encryption effectiveness of the LZUC cipher.
21
Fang, Xing, Hongxin Zhang, Xiaotong Cui, Yuanzhen Wang i Linxi Ding. "Efficient Attack Scheme against SKINNY-64 Based on Algebraic Fault Analysis". Entropy 25, nr 6 (7.06.2023): 908. http://dx.doi.org/10.3390/e25060908.
Pełny tekst źródłaStreszczenie:
Lightweight block ciphers are normally used in low-power resource-constrained environments, while providing reliable and sufficient security. Therefore, it is important to study the security and reliability of lightweight block ciphers. SKINNY is a new lightweight tweakable block cipher. In this paper, we present an efficient attack scheme for SKINNY-64 based on algebraic fault analysis. The optimal fault injection location is given by analyzing the diffusion of a single-bit fault at different locations during the encryption process. At the same time, by combining the algebraic fault analysis method based on S-box decomposition, the master key can be recovered in an average time of 9 s using one fault. To the best of our knowledge, our proposed attack scheme requires fewer faults, is faster to solve, and has a higher success rate than other existing attack methods.
22
Zhong, Xiao Jun, i Lu Yao. "A Lightweight Message Encrypt Protocol for Electronic Commerce". Applied Mechanics and Materials 432 (wrzesień 2013): 545–48. http://dx.doi.org/10.4028/www.scientific.net/amm.432.545.
Pełny tekst źródłaStreszczenie:
In this paper, we propose a publicly verifiable batch encryption scheme. It allows a trusted entity to verify that two or more cipher texts hind the same message without revealing it. The message can also be verified by running a single PVE scheme with the same public value for each cipher text. However, it requires more computation than our scheme. According to our analysis, our scheme can reduce the overhead of computations by 66%. Furthermore, our scheme can be applied to voting and network testing to prove the fairness.
23
Fathy, Cherine, i Hassan M. Ali. "A Secure IoT-Based Irrigation System for Precision Agriculture Using the Expeditious Cipher". Sensors 23, nr 4 (13.02.2023): 2091. http://dx.doi.org/10.3390/s23042091.
Pełny tekst źródłaStreszczenie:
Due to the recent advances in the domain of smart agriculture as a result of integrating traditional agriculture and the latest information technologies including the Internet of Things (IoT), cloud computing, and artificial intelligence (AI), there is an urgent need to address the information security-related issues and challenges in this field. In this article, we propose the integration of lightweight cryptography techniques into the IoT ecosystem for smart agriculture to meet the requirements of resource-constrained IoT devices. Moreover, we investigate the adoption of a lightweight encryption protocol, namely, the Expeditious Cipher (X-cipher), to create a secure channel between the sensing layer and the broker in the Message Queue Telemetry Transport (MQTT) protocol as well as a secure channel between the broker and its subscribers. Our case study focuses on smart irrigation systems, and the MQTT protocol is deployed as the application messaging protocol in these systems. Smart irrigation strives to decrease the misuse of natural resources by enhancing the efficiency of agricultural irrigation. This secure channel is utilized to eliminate the main security threat in precision agriculture by protecting sensors’ published data from eavesdropping and theft, as well as from unauthorized changes to sensitive data that can negatively impact crops’ development. In addition, the secure channel protects the irrigation decisions made by the data analytics (DA) entity regarding the irrigation time and the quantity of water that is returned to actuators from any alteration. Performance evaluation of our chosen lightweight encryption protocol revealed an improvement in terms of power consumption, execution time, and required memory usage when compared with the Advanced Encryption Standard (AES). Moreover, the selected lightweight encryption protocol outperforms the PRESENT lightweight encryption protocol in terms of throughput and memory usage.
24
Dunmore, Aeryn, Juliet Samandari i Julian Jang-Jaccard. "Matrix Encryption Walks for Lightweight Cryptography". Cryptography 7, nr 3 (16.08.2023): 41. http://dx.doi.org/10.3390/cryptography7030041.
Pełny tekst źródłaStreszczenie:
In this paper, we propose a new symmetric stream cipher encryption algorithm based on Graph Walks and 2-dimensional matrices, called Matrix Encryption Walks (MEW). We offer example Key Matrices and show the efficiency of the proposed method, which operates in linear complexity with an extremely large key space and low-resource requirements. We also provide the Proof of Concept code for the encryption algorithm and a detailed analysis of the security of our proposed MEW. The MEW algorithm is designed for low-resource environments such as IoT or smart devices and is therefore intended to be simple in operation. The encryption, decryption, and key generation time, along with the bytes required to store the key, are all discussed, and similar proposed algorithms are examined and compared. We further discuss the avalanche effect, key space, frequency analysis, Shannon entropy, and chosen/known plaintext-ciphertext attacks, and how MEW remains robust against these attacks. We have also discussed the potential for future research into algorithms such as MEW, which make use of alternative structures and graphic methods for improving encryption models.
25
Ruhil, Ankit, Dr Manjot Kaur Bhatia i Pooja kumari. "SLIM: A Lightweight Block Cipher for Internet of Health Things." International Journal for Research in Applied Science and Engineering Technology 10, nr 12 (31.12.2022): 370–81. http://dx.doi.org/10.22214/ijraset.2022.47879.
Pełny tekst źródłaStreszczenie:
Abstract: Increased protection of resource-constrained devices, such as radio frequency identification (RFID) systems, is in high demand these days. For high-resource desktop PCs, current encryption techniques are sufficient. Access control systems, transaction banking systems, and payment systems are all examples of high-security applications where RFID technology are used. The attacker tries to deceive RFIDs in order to gain illegal access to services without paying for them or to get around security measures by detecting a secret password. The most difficult problem with RFID systems is ensuring effective protection against such infringements. For RFID systems, lightweight cryptography can give security assurance. SLIM is a novel ultralightweight cryptography technique for RFID devices presented in this paper. Since block ciphers are the most commonly used cryptographic and provide highly strong protection for IoT devices, SLIM is a 32-bit block cipher based on the Feistel structure. The most difficult aspect of creating a lightweight block cipher is balancing performance, cost, and security. SLIM, like all symmetric block ciphers, encrypts and decrypts using the same key. The suggested method performs well in both hardware and software contexts, has a small implementation footprint, a reasonable cost/security ratio for RFID devices, and is energyefficient. SLIM has shown high immunity to the most successful linear and differential cryptanalysis assaults, as well as a substantial margin of defense against them.
26
Fadhil, Heba Mohammed, Mohamed Elhoseny i Baydaa M. Mushgil. "Protecting Medical Data on the Internet of Things with an Integrated Chaotic-GIFT Lightweight Encryption Algorithm". Journal of Cybersecurity and Information Management 12, nr 1 (2023): 50–66. http://dx.doi.org/10.54216/jcim.120105.
Pełny tekst źródłaStreszczenie:
The secure transmission of medical data is crucial for the protection of patients' privacy and confidentiality. With the advent of IoT in healthcare, medical data is being transmitted over networks that are vulnerable to cyberattacks. Therefore, there is an urgent need for lightweight yet secure encryption algorithms that can protect medical data in transit. In this paper, we propose an integrated Chaotic-GIFT algorithm for lightweight and robust encryption of medical data transmitted over IoT networks. The proposed algorithm combines the chaos theory with a lightweight block cipher to provide secure and efficient encryption of medical data. The Chaotic-GIFT algorithm employs bit-level shuffling and substitution of medical images to provide encryption, while the chaotic sequence generated by the logistic map is used as the cryptographic key for added security. The proposed Chaotic-GIFT algorithm provides a lightweight and efficient solution for the secure transmission of medical data over IoT networks. Evaluation of the algorithm's effectiveness was conducted using multiple metrics including encryption and decryption time, throughput, avalanche effect, non-linearity analysis, and correlation coefficient.
27
Cherckesova, Larissa, Olga Safaryan, Pavel Razumov, Dmitry Medvedev, Veronica Kravchenko i Yuriy Ivanov. "Analysis of block encryption algorithms being used in devices with restricted amount of technological possibilities". E3S Web of Conferences 224 (2020): 01043. http://dx.doi.org/10.1051/e3sconf/202022401043.
Pełny tekst źródłaStreszczenie:
This report is devoted to the comparative analysis of the lightweight NASH block encryption algorithm and the algorithm presented by USA National Security Agency in 2013 – SPECK. Their detailed description is given, the analysis is made. The task of the study is to investigate and analyze cryptographic encryption algorithms used in devices with limited capabilities such as microcontrollers. The study of lightweight encryption algorithms and their application for cybersecurity tasks is necessary to create the latest cryptographic systems aimed at preventing various types of attacks. The study revealed that the NASH block encryption algorithm showed more optimized performance, since the number of rounds of cipher execution is less than that Speck algorithm, which provides greater stability of algorithm with least number of executable rounds.
28
Jin, Jungha, Yewon Oh i Keecheon Kim. "A Lightweight Block Cipher Algorithm for Secure SDN Environment". International Journal of Advanced Research in Engineering 4, nr 4 (30.12.2018): 1. http://dx.doi.org/10.24178/ijare.2018.4.4.01.
Pełny tekst źródłaStreszczenie:
Software Defined Network is a next-generation networking technology that transforms a closed network environment based on existing network vendors into a flexible, software-based, centralized management environment that can be simplified by abstracting and programming. Although these advantages can be applied to some security problems rather than existing networks, most of the security problems and vulnerabilities of existing networks are present and various attacks are taking place. In this paper, we propose a structure to enhance the security function of SDN by checking how to implement the network security function using SDN technology and lightening the existing block cipher algorithm for this security problem. Lightweight-AES algorithm, which is a lightweight block cipher algorithm based on the AES-256 algorithm, which can simultaneously satisfy the quality of high level of security. In the case of simply reducing the number of round operations of the AES algorithm, the difference diffusion effect of the KeySchedule function generating the round key is reduced, and the security of the encryption algorithm is degraded due to the related key attack using the related key difference characteristic. The Lightweight-AES algorithm proposed in this paper improves the rate of cancellation and decryption by reducing the number of round operations, and the round internal function is supplemented to increase the differential diffusion effect of the KeySchedule function. In order to evaluate the performance of the Lightweight-AES algorithm proposed in this paper, a comparison simulation is performed with the existing AES algorithm. As a result, we confirmed that the Lightweight-AES algorithm can provide SDN content security equal to the encryption / decryption rate and algorithm security strength of the AES-128 algorithm. Therefore, it is considered that the proposed Lightweight-AES algorithm can provide better security service in SDN environment quality and security than the existing AES-128 algorithm.
29
Alharbi, Adel R., Hassan Tariq, Amer Aljaedi i Abdullah Aljuhni. "Latency-Aware Accelerator of SIMECK Lightweight Block Cipher". Applied Sciences 13, nr 1 (23.12.2022): 161. http://dx.doi.org/10.3390/app13010161.
Pełny tekst źródłaStreszczenie:
This article presents a latency-optimized implementation of the SIMECK lightweight block cipher on a field-programmable-gate-array (FPGA) platform with a block and key lengths of 32 and 64 bits. The critical features of our architecture include parallelism, pipelining, and a dedicated controller. Parallelism splits the digits of the key and data blocks into smaller segments. Then, we use each segmented key and data block in parallel for encryption and decryption computations. Splitting key and data blocks helps reduce the required clock cycles. A two-stage pipelining is used to shorten the critical path and to improve the clock frequency. A dedicated controller is implemented to provide control functionalities. For the performance evaluation of our design, we report implementation results for two different cases on Xilinx 7-series FPGA devices. For our case one, the proposed architecture can operate on 382, 379, and 388 MHz frequencies for Kintex-7, Virtex-7, and Artix-7 devices. On the same Kintex-7, Virtex-7, and Artix-7 devices, the utilized Slices are 49, 51, and 50. For one encryption and decryption computation, our design takes 16 clock cycles. The minimum power consumption is 172 mW on the Kintex-7 device. For the second case, we targeted the same circuit frequency of 50 MHz for synthesis on Kintex-7, Virtex-7, and Artix-7 devices. With minimum hardware resource utilization (51 Slices), the least consumed power of 13.203 mW is obtained for the Kintex-7 device. For proof-of-concept, the proposed SIMECK design is validated on the NEXYS 4 FPGA with the Artix-7 device. Consequently, the implementation results reveal that the proposed architecture is suitable for many resource-constrained cryptographic applications.
30
Zhang, Ping. "Permutation-Based Lightweight Authenticated Cipher with Beyond Conventional Security". Security and Communication Networks 2021 (27.10.2021): 1–9. http://dx.doi.org/10.1155/2021/1468007.
Pełny tekst źródłaStreszczenie:
Lightweight authenticated ciphers are specially designed as authenticated encryption (AE) schemes for resource-constrained devices. Permutation-based lightweight authenticated ciphers have gained more attention in recent years. However, almost all of permutation-based lightweight AE schemes only ensure conventional security, i.e., about c / 2 -bit security, where c is the capacity of the permutation. This may be vulnerable for an insufficiently large capacity. This paper focuses on the stronger security guarantee and the better efficiency optimization of permutation-based lightweight AE schemes. On the basis of APE series (APE, APE R I , APE O W , and APE C A ), we propose a new improved permutation-based lightweight online AE mode APE + which supports beyond conventional security and concurrent absorption. Then, we derive a simple security proof and prove that APE + enjoys at most about min r , c -bit security, where r is the rate of the permutation. Finally, we discuss the properties of APE + on the hardware implementation.
31
Chakraborty, Bishwajit, i Mridul Nandi. "The mF mode of authenticated encryption with associated data". Journal of Mathematical Cryptology 16, nr 1 (1.01.2022): 73–97. http://dx.doi.org/10.1515/jmc-2020-0054.
Pełny tekst źródłaStreszczenie:
Abstract In recent years, the demand for lightweight cryptographic protocols has grown immensely. To fulfill this necessity, the National Institute of Standards and Technology (NIST) has initiated a standardization process for lightweight cryptographic encryption. NIST’s call for proposal demands that the scheme should have one primary member that has a key length of 128 bits, and it should be secure up to 2 50 − 1 {2}^{50}-1 byte queries and 2 112 {2}^{112} computations. In this article, we propose a tweakable block cipher (TBC)-based authenticated encryption with associated data (AEAD) scheme, which we call mF {\mathsf{mF}} . We provide authenticated encryption security analysis for mF {\mathsf{mF}} under some weaker security assumptions (stated in the article) on the underlying TBC. We instantiate a TBC using block cipher and show that the TBC achieves these weaker securities, provided the key update function has high periodicity. mixFeed {\mathsf{mixFeed}} is a round 2 candidate in the aforementioned lightweight cryptographic standardization competition. When we replace the key update function with the key scheduling function of Advanced Encryption Standard (AES), the mF {\mathsf{mF}} mode reduces to mixFeed {\mathsf{mixFeed}} . Recently, the low periodicity of AES key schedule is shown. Exploiting this feature, a practical attack on mixFeed {\mathsf{mixFeed}} is reported. We have shown that multiplication by primitive element satisfies the high periodicity property, and we have a secure instantiation of mF {\mathsf{mF}} , a secure variant of mixFeed {\mathsf{mixFeed}} .
32
Ghanim Sulaiman, Alyaa, i Sufyan Salim Mahmood AlDabbagh. "Modified 128-EEA2 Algorithm by Using HISEC Lightweight Block Cipher Algorithm with Improving the Security and Cost Factors". Indonesian Journal of Electrical Engineering and Computer Science 10, nr 1 (1.04.2018): 337. http://dx.doi.org/10.11591/ijeecs.v10.i1.pp337-342.
Pełny tekst źródłaStreszczenie:
<span>128-EEA2 (Evolved Packet System Encryption Algorithm 2) is a confidentiality algorithm which is used to encrypt and decrypt block of data based on confidentiality key. This confidentiality algorithm 128-EEA2 is based on the AES-128 which is the block cipher algorithm of 128 bit in CTR mode. In this paper, we are going to replace the AES-128 block cipher algorithm by HISEC block cipher algorithm for two reasons such as reducing cost and ameliorate security factor.</span>
33
Kwon, Hyeokdong, SangWoo An, YoungBeom Kim, Hyunji Kim, Seung Ju Choi, Kyoungbae Jang, Jaehoon Park, Hyunjun Kim, Seog Chung Seo i Hwajeong Seo. "Designing a CHAM Block Cipher on Low-End Microcontrollers for Internet of Things". Electronics 9, nr 9 (22.09.2020): 1548. http://dx.doi.org/10.3390/electronics9091548.
Pełny tekst źródłaStreszczenie:
As the technology of Internet of Things (IoT) evolves, abundant data is generated from sensor nodes and exchanged between them. For this reason, efficient encryption is required to keep data in secret. Since low-end IoT devices have limited computation power, it is difficult to operate expensive ciphers on them. Lightweight block ciphers reduce computation overheads, which are suitable for low-end IoT platforms. In this paper, we implemented the optimized CHAM block cipher in the counter mode of operation, on 8-bit AVR microcontrollers (i.e., representative sensor nodes). There are four new techniques applied. First, the execution time is drastically reduced, by skipping eight rounds through pre-calculation and look-up table access. Second, the encryption with a variable-key scenario is optimized with the on-the-fly table calculation. Third, the encryption in a parallel way makes multiple blocks computed in online for CHAM-64/128 case. Fourth, the state-of-art engineering technique is fully utilized in terms of the instruction level and register level. With these optimization methods, proposed optimized CHAM implementations for counter mode of operation outperformed the state-of-art implementations by 12.8%, 8.9%, and 9.6% for CHAM-64/128, CHAM-128/128, and CHAM-128/256, respectively.
34
Kanda, Guard, i Kwangki Ryoo. "Vedic Multiplier-based International Data Encryption Algorithm Crypto-Core for Efficient Hardware Multiphase Encryption Design". Webology 19, nr 1 (20.01.2022): 4581–96. http://dx.doi.org/10.14704/web/v19i1/web19304.
Pełny tekst źródłaStreszczenie:
At present, there are several pieces of research on designing and implementing new cryptographic algorithms that are lightweight and resistant to several, if not major forms of security attacks. However, some algorithms such as the International Data Encryption Algorithm (IDEA), which has been around for some time is yet to record any real threat against its functionality. To ensure its continued usage, current implementations rely on multiphase encryption where it is combined with other algorithms such as ROTation (ROT) and Data Encryption Standard (DES) for maximum security strength. Multiphase encryption implies that there is a tendency for an increase in hardware area and a reduction in overall speed. In such cases, having fast and reduced area algorithms are much desired. This paper, therefore, proposes an efficient hardware implementation of the IDEA cipher that is based on arithmetic modulo multiplication—one of the main computations of the IDEA—on a novel Vedic multiplier architecture. The increase in efficiency of the IDEA crypto architecture and the reduction in resources utilization is achieved through an enhancement of its structural architecture to utilize a fixed set of resources for all eight identical rounds of computation and the use of a proposed fast and lightweight Vedic hardware multiplier. The proposed hardware modification and resulting architecture are designed using the Xilinx ISE and Vivado tools. The architecture is synthesized using Precision Synthesis Tool (PS) and simulated using Modelsim SE 10.6d and ISIM simulation tools. The proposed IDEA cipher is 100% more efficient when designed based on the Vedic multiplier compared to existing designs. The hardware architecture is implemented on Spartan-6-FGG484 Field Programmable Gate Array (FPGA) using Verilog HDL. Verified results show that the proposed Vedic-based IDEA occupied 212 Slices with the Vedic multiplier only occupying 28 Slices out of the total 212. The proposed architecture operates at a maximum frequency of 253.3 MHz.
35
Han, Guoyong, i Wenying Zhang. "Improved Biclique Cryptanalysis of the Lightweight Block Cipher Piccolo". Security and Communication Networks 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/7589306.
Pełny tekst źródłaStreszczenie:
Biclique cryptanalysis is a typical attack through finding a biclique which is a type of bipartite diagram to reduce the computational complexity. By investigating the subkey distribution and the encryption structure, we find out a weakness in the key schedule of Piccolo-80. A 6-round biclique is constructed for Piccolo-80 and a 7-round biclique for Piccolo-128. Then a full round biclique cryptanalysis of Piccolo is presented. The results of the attacks are with data complexity of 240and 224chosen ciphertexts and with computational complexity of 279.22and 2127.14, respectively. They are superior to other known results of biclique cryptanalytic on Piccolo.
36
Winarno, Agus, i Riri Fitri Sari. "A Novel Secure End-to-End IoT Communication Scheme Using Lightweight Cryptography Based on Block Cipher". Applied Sciences 12, nr 17 (1.09.2022): 8817. http://dx.doi.org/10.3390/app12178817.
Pełny tekst źródłaStreszczenie:
Personal data security is a cybersecurity trend that has captured the world’s attention. Governments, practitioners and academics are jointly building personal data security in various communication systems, including IoT. The protocol that is widely used in IoT implementation is MQTT. By default, MQTT does not provide data security features in the form of data encryption. Therefore, this research was carried out on the design of Secure End-to-End Encryption MQTT with Block Cipher-Based Lightweight Cryptography. The protocol is designed by utilizing the Galantucci secret sharing scheme and a lightweight cryptographic algorithm based on a block cipher. The algorithms used include AES-128 GCM mode, GIFT-COFB, Romulus N1, and Tiny JAMBU. We tested the Secure End-to-End for MQTT protocol on the ARM M4 and ESP8266 processors. Our testing results on NodeMCU board, Tiny JAMBU have an average encryption time of 313 and an average decryption time of 327 . AES-128 GCM mode has an average encryption time of 572 and an average decryption time of 584 . GIFT-COFB has an average encryption time of 1094 and an average decryption time of 1110 . Meanwhile, Romulus N1 has an average encryption time of 2157 and an average decryption time of 2180 . On STM32L4 discovery, Tiny JAMBU had average encryption of 82 and an average decryption time of 85 . AES-128 GCM mode has an average encryption time of 163 and an average decryption time of 164 . GIFT-COFB has an average encryption time of 164 and an average decryption time of 165 . Meanwhile, Romulus N1 has an average encryption time of 605 and an average decryption time of 607 . Our experiment shows that the fastest performance is produced by Tiny JAMBU, followed by AES-128 Mode GCM, GIFT-COFB and Romulus N1.
37
Tripathy, Alakananda, Sateesh Kumar Pradhan, Ajit Kumar Nayak, Smita Rath i Alok Ranjan Tripathy. "Integration of PRESENT Cipher Model Using Bit Permutation in Wireless Sensor Network for Data Security". Journal of Computational and Theoretical Nanoscience 17, nr 11 (1.11.2020): 5037–45. http://dx.doi.org/10.1166/jctn.2020.9338.
Pełny tekst źródłaStreszczenie:
Security of data has become the biggest concern in recent years, due to the growing number of wireless networks. Accordingly, cryptography is becoming essential in improving data security. Encryption schemes that transforms the data into an incomprehensible shape. It plays an important role in applications such as wireless sensor networks, as most of the data is transmitted through an unsafe channel. Ultra-lightweight cryptography is one the most preferable research areas which having significant contribution towards the security aspects. There is a low power block cipher PRESENT. In this proposed work a PRESENT as reference block cipher is implemented. Here a method called PRESENT block cipher is used with key shuffling and S-Box. This method produces a 64 bits cipher text as result on input text of size 64 bits and key having of 128 bit. This developed method gives better results in comparison to other existing cipher on performance on different hardware and software platforms. With less memory requirement it produces a higher accuracy and confidentiality of the message is maintained. The proposed cipher have the better encryption time, decryption time, throughput. This proposed cipher has better resistance to crypt analysis according to avalanche effect. This proposed cipher can well be applicable for application where small traced area and low power decadence are vital design metrics.
38
Sawka, Maciej, i Marcin Niemiec. "A Sponge-Based Key Expansion Scheme for Modern Block Ciphers". Energies 15, nr 19 (20.09.2022): 6864. http://dx.doi.org/10.3390/en15196864.
Pełny tekst źródłaStreszczenie:
Many systems in use today require strong cryptographic primitives to ensure confidentiality and integrity of data. This is especially true for energy systems, such as smart grids, as their proper operation is crucial for the existence of a functioning society. Because of this, we observe new developments in the field of cryptography every year. Among the developed primitives, one of the most important and widely used are iterated block ciphers. From AES (Advanced Encryption Standard) to LEA (Lightweight Encryption Algorithm), these ciphers are omnipresent in our world. While security of the encryption process of these ciphers is often meticulously tested and verified, an important part of them is neglected—the key expansion. Many modern ciphers use key expansion algorithms which produce reversible sub-key sequences. This means that, if the attacker finds out a large-enough part of this sequence, he/she will be able to either calculate the rest of the sequence, or even the original key. This could completely compromise the cipher. This is especially concerning due to research done into side-channel attacks, which attempt to leak secret information from memory. In this paper, we propose a novel scheme which can be used to create key expansion algorithms for modern ciphers. We define two important properties that a sequence produced by such algorithm should have and ensure that our construction fulfills them, based on the research on hashing functions. In order to explain the scheme, we describe an example algorithm constructed this way, as well as a cipher called IJON which utilizes it. In addition to this, we provide results of statistical tests which show the unpredictability of the sub-key sequence produced this way. The tests were performed using a test suite standardized by NIST (National Institute for Standards and Technology). The methodology of our tests is also explained. Finally, the reference implementation of the IJON cipher is published, ready to be used in software. Based on the results of tests, we conclude that, while more research and more testing of the algorithm is advised, the proposed key expansion scheme provides a very good generation of unpredictable bits and could possibly be used in practice.
39
Zhang, Xing, Shaoyu Tang, Tianning Li, Xiaowei Li i Changda Wang. "GFRX: A New Lightweight Block Cipher for Resource-Constrained IoT Nodes". Electronics 12, nr 2 (12.01.2023): 405. http://dx.doi.org/10.3390/electronics12020405.
Pełny tekst źródłaStreszczenie:
The study of lightweight block ciphers has been a "hot topic". As one of the main structures of block ciphers, the Feistel structure has attracted much attention. However, the traditional Feistel structure cipher changes only half of the plaintext in an iterative round, resulting in slow diffusion. Therefore, more encryption rounds are required to ensure security. To address this issue, a new algorithm, GFRX, is proposed, which combines a generalized Feistel structure and ARX (Addition or AND, Rotation, XOR). The GFRX algorithm uses an ARX structure with different non-linear components to deal with all the branches of a generalized Feistel structure so that it can achieve a better diffusion effect in fewer rounds. {The results of a security analysis of the GFRX algorithm show that the effective differential attacks do not exceed 19 rounds and that the effective linear attacks do not exceed 13 rounds.} Therefore, the GFRX algorithm has an adequate security level for differential and linear analysis. Avalanche test results obtained for the GFRX algorithm show that the GFRX algorithm has strong diffusion and only takes six rounds to meet the avalanche effect. In addition, the GFRX algorithm can achieve different serialization levels depending on different hardware resource requirements and can achieve full serialization, which ensures operational flexibility in resource-constrained environments.
40
A. Dawood, Omar. "Fast lightweight block cipher design with involution substitution permutation network (SPN) structure". Indonesian Journal of Electrical Engineering and Computer Science 20, nr 1 (1.10.2020): 361. http://dx.doi.org/10.11591/ijeecs.v20.i1.pp361-369.
Pełny tekst źródłaStreszczenie:
<p>In the present paper, a new cryptographic lightweight algorithm has been developed for the Internet of Things (IoT) applications. The submitted cipher designed with the involution Substitution Permutation Network SPN structure. The involution structure means that the same encryption algorithm is used in the decryption process except the ciphering key algorithm is applied in reverse order. The introduced algorithm encrypts the data with a block size of 128-bit 192-bit or 256-bit, which iterative with 10, 12 and 14-rounds respectively similar to the AES cipher. The design aspect supports an elegant structure with a secure involution round transformation. The main round is built without S-Box stage instead that it uses the on-fly immediate computing stage and the involution of mathematical invertible affine equations. The proposed cipher is adopted to work in a restricted environment and with limited resources pertaining to embedded devices. The proposed cipher introduces an accepted security level and reasonable Gate Equivalent (GE) estimation with fast implementation.</p>
41
Peng, Chunyan, Xiujuan Du, Keqin Li i Meiju Li. "An Ultra-Lightweight Encryption Scheme in Underwater Acoustic Networks". Journal of Sensors 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/8763528.
Pełny tekst źródłaStreszczenie:
We tackle a fundamental security problem in underwater acoustic networks (UANs). The S-box in the existing block encryption algorithm is more energy consuming and unsuitable for resources-constrained UANs. In this paper, instead of S-box, we present a lightweight, 8-round iteration block cipher algorithm for UANs communication based on chaotic theory and increase the key space by changing the number of iteration round. We further propose secure network architecture of UANs. By analysis, our algorithm can resist brute-force searches and adversarial attacks. Simulation results show that, compared with traditional AES-128 and PRESENT algorithms, our cryptographic algorithm can make a good trade-off between security and overhead, has better energy efficiency, and applies to UANs.
42
An, SangWoo, YoungBeom Kim, Hyeokdong Kwon, Hwajeong Seo i Seog Chung Seo. "Parallel Implementations of ARX-Based Block Ciphers on Graphic Processing Units". Mathematics 8, nr 11 (31.10.2020): 1894. http://dx.doi.org/10.3390/math8111894.
Pełny tekst źródłaStreszczenie:
With the development of information and communication technology, various types of Internet of Things (IoT) devices have widely been used for convenient services. Many users with their IoT devices request various services to servers. Thus, the amount of users’ personal information that servers need to protect has dramatically increased. To quickly and safely protect users’ personal information, it is necessary to optimize the speed of the encryption process. Since it is difficult to provide the basic services of the server while encrypting a large amount of data in the existing CPU, several parallel optimization methods using Graphics Processing Units (GPUs) have been considered. In this paper, we propose several optimization techniques using GPU for efficient implementation of lightweight block cipher algorithms on the server-side. As the target algorithm, we select high security and light weight (HIGHT), Lightweight Encryption Algorithm (LEA), and revised CHAM, which are Add-Rotate-Xor (ARX)-based block ciphers, because they are used widely on IoT devices. We utilize the features of the counter (CTR) operation mode to reduce unnecessary memory copying and operations in the GPU environment. Besides, we optimize the memory usage by making full use of GPU’s on-chip memory such as registers and shared memory and implement the core function of each target algorithm with inline PTX assembly codes for maximizing the performance. With the application of our optimization methods and handcrafted PTX codes, we achieve excellent encryption throughput of 468, 2593, and 3063 Gbps for HIGHT, LEA, and revised CHAM on RTX 2070 NVIDIA GPU, respectively. In addition, we present optimized implementations of Counter Mode Based Deterministic Random Bit Generator (CTR_DRBG), which is one of the widely used deterministic random bit generators to provide a large amount of random data to the connected IoT devices. We apply several optimization techniques for maximizing the performance of CTR_DRBG, and we achieve 52.2, 24.8, and 34.2 times of performance improvement compared with CTR_DRBG implementation on CPU-side when HIGHT-64/128, LEA-128/128, and CHAM-128/128 are used as underlying block cipher algorithm of CTR_DRBG, respectively.
43
Liu, Ya, Yifan Shi, Dawu Gu, Zhiqiang Zeng, Fengyu Zhao, Wei Li, Zhiqiang Liu i Yang Bao. "Improved Meet-in-the-Middle Attacks on Reduced-Round Kiasu-BC and Joltik-BC". Computer Journal 62, nr 12 (3.07.2019): 1761–76. http://dx.doi.org/10.1093/comjnl/bxz059.
Pełny tekst źródłaStreszczenie:
Abstract Kiasu-BC and Joltik-BC are internal tweakable block ciphers of authenticated encryption algorithms Kiasu and Joltik submitted to the CAESAR competition. Kiasu-BC is a 128-bit block cipher, of which tweak and key sizes are 64 and 128 bits, respectively. Joltik-BC-128 is a 64-bit lightweight block cipher supporting 128 bits tweakey. Its designers recommended the key and tweak sizes are both 64 bits. In this paper, we propose improved meet-in-the-middle attacks on 8-round Kiasu-BC, 9-round and 10-round Joltik-BC-128 by exploiting properties of their structures and using precomputation tables and the differential enumeration. For Kiasu-BC, we build a 5-round distinguisher to attack 8-round Kiasu-BC with $2^{109}$ plaintext–tweaks, $2^{112.8}$ encrytions and $2^{92.91}$ blocks. Compared with previously best known cryptanalytic results on 8-round Kiasu-BC under chosen plaintext attacks, the data and time complexities are reduced by $2^{7}$ and $2^{3.2}$ times, respectively. For the recommended version of Joltik-BC-128, we construct a 6-round distinguisher to attack 9-round Joltik-BC-128 with $2^{53}$ plaintext–tweaks, $2^{56.6}$ encryptions and $2^{52.91}$ blocks, respectively. Compared with previously best known results, the data and time complexities are reduced by $2^7$ and $2^{5.1}$ times, respectively. In addition, we present a 6.5-round distinguisher to attack 10-round Joltik-BC-128 with $2^{53}$ plaintext–tweaks, $2^{101.4}$ encryptions and $2^{76.91}$ blocks.
44
Shifa, Amna, Mamoona Asghar, Salma Noor, Neelam Gohar i Martin Fleury. "Lightweight Cipher for H.264 Videos in the Internet of Multimedia Things with Encryption Space Ratio Diagnostics". Sensors 19, nr 5 (11.03.2019): 1228. http://dx.doi.org/10.3390/s19051228.
Pełny tekst źródłaStreszczenie:
Within an Internet of Multimedia Things, the risk of disclosing streamed video content, such as that arising from video surveillance, is of heightened concern. This leads to the encryption of that content. To reduce the overhead and the lack of flexibility arising from full encryption of the content, a good number of selective-encryption algorithms have been proposed in the last decade. Some of them have limitations, in terms of: significant delay due to computational cost, or excess memory utilization, or, despite being energy efficient, not providing a satisfactory level of confidentiality, due to their simplicity. To address such limitations, this paper presents a lightweight selective encryption scheme, in which encoder syntax elements are encrypted with the innovative EXPer (extended permutation with exclusive OR). The selected syntax elements are taken from the final stage of video encoding that is during the entropy coding stage. As a diagnostic tool, the Encryption Space Ratio measures encoding complexity of the video relative to the level of encryption so as to judge the success of the encryption process, according to entropy coder. A detailed comparative analysis of EXPer with other state-of-the-art encryption algorithms confirms that EXPer provides significant confidentiality with a small computational cost and a negligible encryption bitrate overhead. Thus, the results demonstrate that the proposed security scheme is a suitable choice for constrained devices in an Internet of Multimedia Things environment.
45
Chatterjee, Runa, Rajdeep Chakraborty i Mondal J.K. "DESIGN OF LIGHTWEIGHT CRYPTOGRAPHIC MODEL FOR END-TO-END ENCRYPTION IN IOT DOMAIN". IRO Journal on Sustainable Wireless Systems 1, nr 04 (8.12.2019): 215–24. http://dx.doi.org/10.36548/jsws.2019.4.002.
Pełny tekst źródłaStreszczenie:
Digitalization rapidly connected the entire world. Everyday an enormous volumes of digital data produced by billions of intelligent devices which requires safe transmission over internet. If we look into embedded environment, handling massive volume of data is impractical for low power and low memory devices which leads to lightweight concept. The proposed lightweight model includes many symmetric key sequentially. The model follows fiestel network structure where 64 bits input block divided by two 32 bits blocks. Then every half undergoes through various symmetric key algorithms like TE (Triangular Encryption), RPPT (Recursive Pared Parity Technique), RPSPNC( Recursive Positional Substitution on Prime-Nonprime of Cluster), TB(Transformation of Bits) and bits rotation process. A triangular bit sequence generated by TE and from there various encryption as well as decryption techniques[1] have generated by reading bits in a certain order. RPPT encrypts bits by executing logical OR of successive bits. Bit swapping technique is used by TB for encryption and decryption. RPSPNC interchanges bits on the basis of prime-non prime bit position and considers any in between bit sequence as a cipher text. Lastly two resultant sub-blocks are merged to produce cipher text of 64 bits. To check the acceptance of the proposed model, comparisons take place with popular symmetric key algorithm AES and one embedded algorithm RPPT+TB. Software parameters like entropy, n-gram(4-gram), non-homogeneity, histogram are analysed. Hardware analysis of the model ensures us that it falls into lightweight domain by comparing the GE (Gate equivalent) with the ISO /IEC standard value ranges between 1000-2000GE.
46
Thorat, C. G., i V. S. Inamdar. "Implementation of new hybrid lightweight cryptosystem". Applied Computing and Informatics 16, nr 1/2 (4.05.2018): 195–206. http://dx.doi.org/10.1016/j.aci.2018.05.001.
Pełny tekst źródłaStreszczenie:
Embedded systems, Internet of Things (IoT) and mobile computing devices are used in various domains which include public-private infrastructure, industrial installation and critical environment. Generally, information handled by these devices is private and critical. Therefore, it must be appropriately secured from different attacks and hackers. Lightweight cryptography is an aspiring field which investigates the implementation of cryptographic primitives and algorithms for resource constrained devices. In this paper, a new compact hybrid lightweight encryption technique has been proposed. Proposed technique uses the fastest bit permutation instruction PERMS with S-box of PRESENT block cipher for non-linearity. An arbitrary n-bit permutation is performed using PERMS instruction in less than log (n) number of instructions. This new hybrid system has been analyzed for software performance on Advanced RISC Machine (ARM) and Intel processor whereas Cadens tool is used to analyze the hardware performance. The result of the proposed technique is improved by the factor of eight as compared to the PRESENT-GRP hybrid block cipher. Moreover, PERMS instruction bit permutation properties result a very good avalanche effect and compact implementation in the both hardware and software environment.
47
El-hajj, Mohammed, Hussien Mousawi i Ahmad Fadlallah. "Analysis of Lightweight Cryptographic Algorithms on IoT Hardware Platform". Future Internet 15, nr 2 (30.01.2023): 54. http://dx.doi.org/10.3390/fi15020054.
Pełny tekst źródłaStreszczenie:
Highly constrained devices that are interconnected and interact to complete a task are being used in a diverse range of new fields. The Internet of Things (IoT), cyber-physical systems, distributed control systems, vehicular systems, wireless sensor networks, tele-medicine, and the smart grid are a few examples of these fields. In any of these contexts, security and privacy might be essential aspects. Research on secure communication in Internet of Things (IoT) networks is a highly contested topic. One method for ensuring secure data transmission is cryptography. Because IoT devices have limited resources, such as power, memory, and batteries, IoT networks have boosted the term “lightweight cryptography”. Algorithms for lightweight cryptography are designed to efficiently protect data while using minimal resources. In this research, we evaluated and benchmarked lightweight symmetric ciphers for resource-constrained devices. The evaluation is performed using two widely used platform: Arduino and Raspberry Pi. In the first part, we implemented 39 block ciphers on an ATMEGA328p microcontroller and analyzed them in the terms of speed, cost, and energy efficiency during encryption and decryption for different block and key sizes. In the second part, the 2nd-round NIST candidates (80 stream and block cipher algorithms) were added to the first-part ciphers in a comprehensive analysis for equivalent block and key sizes in the terms of latency and energy efficiency.
48
Saraiva, Daniel A. F., Valderi Reis Quietinho Leithardt, Diandre de Paula, André Sales Mendes, Gabriel Villarrubia González i Paul Crocker. "PRISEC: Comparison of Symmetric Key Algorithms for IoT Devices". Sensors 19, nr 19 (5.10.2019): 4312. http://dx.doi.org/10.3390/s19194312.
Pełny tekst źródłaStreszczenie:
With the growing number of heterogeneous resource-constrained devices connected to the Internet, it becomes increasingly challenging to secure the privacy and protection of data. Strong but efficient cryptography solutions must be employed to deal with this problem, along with methods to standardize secure communications between these devices. The PRISEC module of the UbiPri middleware has this goal. In this work, we present the performance of the AES (Advanced Encryption Standard), RC6 (Rivest Cipher 6), Twofish, SPECK128, LEA, and ChaCha20-Poly1305 algorithms in Internet of Things (IoT) devices, measuring their execution times, throughput, and power consumption, with the main goal of determining which symmetric key ciphers are best to be applied in PRISEC. We verify that ChaCha20-Poly1305 is a very good option for resource constrained devices, along with the lightweight block ciphers SPECK128 and LEA.
49
Chatamoni, Anil Kumar, i Rajendra Naik Bhukya. "Lightweight Compressive Sensing for Joint Compression and Encryption of Sensor Data". International Journal of Engineering and Technology Innovation 12, nr 2 (22.02.2022): 167–81. http://dx.doi.org/10.46604/ijeti.2022.8599.
Pełny tekst źródłaStreszczenie:
The security and energy efficiency of resource-constrained distributed sensors are the major concerns in the Internet of Things (IoT) network. A novel lightweight compressive sensing (CS) method is proposed in this study for simultaneous compression and encryption of sensor data in IoT scenarios. The proposed method reduces the storage space and transmission cost and increases the IoT security, with joint compression and encryption of data by image sensors. In this proposed method, the cryptographic advantage of CS with a structurally random matrix (SRM) is considered. Block compressive sensing (BCS) with an SRM-based measurement matrix is performed to generate the compressed and primary encrypted data. To enhance security, a stream cipher-based pseudo-error vector is added to corrupt the compressed data, preventing the leakage of statistical information. The experimental results and comparative analyses show that the proposed scheme outperforms the conventional and state-of-art schemes in terms of reconstruction performance and encryption efficiency.
50
Liu, Hui, Bo Zhao, Jianwen Zou, Linquan Huang i Yifan Liu. "A Lightweight Image Encryption Algorithm Based on Message Passing and Chaotic Map". Security and Communication Networks 2020 (25.07.2020): 1–12. http://dx.doi.org/10.1155/2020/7151836.
Pełny tekst źródłaStreszczenie:
The popularization of 5G and the development of cloud computing further promote the application of images. The storage of images in an untrusted environment has a great risk of privacy leakage. This paper outlines a design for a lightweight image encryption algorithm based on a message-passing algorithm with a chaotic external message. The message-passing (MP) algorithm allows simple messages to be passed locally for the solution to a global problem, which causes the interaction among adjacent pixels without additional space cost. This chaotic system can generate high pseudorandom sequences with high speed performance. A two-dimensional logistic map is utilized as a pseudorandom sequence generator to yield the external message sets of edge pixels. The external message can affect edge pixels, and then adjacent pixels interact with each other to produce an encrypted image. A MATLAB simulation shows the cipher-image performs fairly uniform distribution and has acceptable information entropy of 7.996749. The proposed algorithm reduces correlation coefficients from plain-image 1 to its cipher-image 0, which covers all of the plain-image characters with high computational efficiency (speed = 18.200374 Mbit/s). Theoretical analyses and experimental results prove the proposed algorithm’s persistence to various existing attacks with low cost.