Gotowa bibliografia na temat „Lightweight Encryption Cipher”

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Radio Frequency Identification, RFID, is a type of automatic identification system which has gained popularity in recent years for being fast and reliable in keeping track of individual objects. Due to limited available resources in RFID tags, providing privacy and security for RFID systems is one of the important challenges nowadays. In this dissertation, a lightweight symmetric encryption algorithm called RBS, Redundant Bit Security, is presented which is suitable for resource constrained applications like RFID systems. Confidentiality of the plaintext in this algorithm is achieved through inserting some redundant bits inside the plaintext bits where the location of redundant bits inside the ciphertext is the secret key shared between sender and receiver. Besides confidentiality, these redundant bits are calculated in such a way that they provide authentication and integrity as well. The security of the algorithm is analyzed against some well-known attacks such as known plaintext, known ciphertext, chosen plaintext, and differential attacks. Experimental and simulation results confirm that RBS implementation requires less power and area overhead compared to other known symmetric algorithms proposed for RFID systems, especially when the authentication is essential like in harsh environments.

With the advent of better health care and medical technology, as well as miniaturized devices with built-in radios, today we can see (WBANs) emerging as one of the main research topics. The sensor nodes worn by patients in a WBAN collect and/or process large amount of data for continuous health monitoring or analysis. However, as the data being dealt with is private and sensitive, even protected by law in many countries, secure data transmission in WBAN is one of key the issues and needs to be addressed before it can be widely deployed. The communication of the sensitive data among the sensors or sensor to health servers give rise to data security concerns like integrity, confidentiality, authentication etc. and the focus of this thesis is to ensure confidentiality of data using encryption, specifically in energy constrained applications as in WBAN. In this thesis, the energy consumption by 14 of the most popular symmetric ci-phers including 11 of the ciphers which are commonly used in lightweight encryption applications have been studied using simulation tool for platform. A new metric called (Metric for Security v/s Energy Consumption) that quantifies the trade-off between en-ergy consumption and security of a cipher has been proposed. In the simulation, the number of CPU cycles have been taken as a measure of energy consumed. It has been shown that the least energy of 0.03 mJ per block is consumed by TEA while LED-64 consumes 2800% (28 times) more energy which is the highest among the investigated ciphers. Taking into consideration the security of these ciphers, the MSEC for these algorithms are -95.56 and -0.615 respectively as their effective key length is very low and can be broken by brute-force. Comparisons show that based on MSEC, AES is the most optimal cipher with MSEC value of 73.3. The same suite of algorithms has also been ported on to a hardware mote called TelosB and the energy consumed by the algorithms and their metric value have been measured. We have observed that as TelosB consumes approximately 60% less energy per CPU cycle as compared to MICAz platform. The total energy consumed by ciphers on is lesser than MICAz thus resulting to comparatively higher metric value for TelosB. It has been shown that the least energy of 0.0123 mJ per block is consumed by TEA while LED-64 consumes 2700% (26.9 times) higher. Taking into consideration the security of these ciphers, the MSEC for these algorithms are -97.69 and -0.75 respectively. Comparisons show that based on MSEC, AES is the most optimal cipher on TelosB as well with MSEC value of 73.3. The comparison between the simulation on Avrora for and the actual realization on a hardware mote has shown that the two results are similar. A deeper study of the lightweight algorithms has also shown that they innovatively mix the various stages of a traditional SPN (Substitution Permutation Network) based cipher like AES. In this thesis, one such new algorithm called LEA (Lightweight Encryption Algorithm) has been proposed which has a skeletal structure similar to AES. The proposed algorithm uses AES S- box for byte-wise substitution and AES key scheduling to generate the round keys. Further, the Shift Rows in AES is replaced by State Transpose step and a new non-linear step called MixBits has been introduced in this cipher which performs bit-wise operations like bitwise shifts and XOR on the input blocks to increase the diffusion property of the cipher. The MixBits step is analogous to the MixColums step of AES. In addition, for improved security, it uses key whitening as proposed in DESX. Based on observations for DESX, the effective key length of LEA comes down to 191 bits which gives a MSEC value of 154.38 while consuming 0.0219 mJ per block on TelosB platform. We have observed that as an effect of the MixBits step, LEA has large number of active S-boxes per round and the properties of confusion and diffusion are spread across all the output bytes by end of round 3 of the cipher. In order to perform the preliminary cryptanalysis on LEA, a byte- wise randomness test was conducted for LEA Optimal cipher with MSEC value of 73.3. The same suite of algorithms has also been ported on to a hardware mote called TelosB and the energy consumed by the algorithms and their metric value have been measured. We have observed that as TelosB consumes approximately 60% less energy per CPU cycle as compared to MICAz platform. The total energy consumed by ciphers on is lesser than MICAz thus resulting to comparatively higher metric value for TelosB. It has been shown that the least energy of 0.0123 mJ per block is consumed by TEA while LED-64 consumes 2700% (26.9 times) higher. Taking into consideration the security of these ciphers, the MSEC for these algorithms are -97.69 and -0.75 respectively. Comparisons show that based on MSEC, AES is the most optimal cipher on TelosB as well with MSEC value of 73.3. The comparison between the simulation on Avrora for and the actual realization on a hardware mote has shown that the two results are similar. A deeper study of the lightweight algorithms has also shown that they innovatively mix the various stages of a traditional SPN (Substitution Permutation Network) based cipher like AES. In this thesis, one such new algorithm called LEA (Lightweight Encryption Algorithm) has been proposed which has a skeletal structure similar to AES. The proposed algorithm uses AES S- box for byte-wise substitution and AES key scheduling to generate the round keys. Further, the Shift Rows in AES is replaced by State Transpose step and a new non-linear step called MixBits has been introduced in this cipher which performs bit-wise operations like bitwise shifts and XOR on the input blocks to increase the diffusion property of the cipher. The MixBits step is analogous to the MixColums step of AES. In addition, for improved security, it uses key whitening as proposed in DESX. Based on observations for DESX, the elective key length of LEA comes down to 191 bits which gives a MSEC value of 154.38 while consuming 0.0219 mJ per block on TelosB platform. We have observed that as an effect of the MixBits step, LEA has large number of active S-boxes per round and the properties of confusion and diffusion are spread across all the output bytes by end of round 3 of the cipher. In order to perform the preliminary cryptanalysis on LEA, a byte- wise randomness test was conducted for LEA on a sample size of 232 in which a very small standard deviation of around 4000 (mean value = 16777216) was observed by end of round 3 indicating that all the possible byte values are spread uniformly across the output block. Also, the energy consumed by LEA is compared with the existing lightweight algorithms and we found that it consumes around 15% more energy than AES but lesser than most other lightweight encryptions proposed in the literature. However the MSEC value of LEA proposed is higher than AES. From the initial cryptanalytic studies, it is possible to conclude that fewer rounds of the proposed algorithm will give rise to better energy efficiency than AES. A detailed cryptanalysis would be needed to provide definitive answer. al cipher with MSEC value of 73.3. The same suite of algorithms has also been ported on to a hardware mote called TelosB and the energy consumed by the algorithms and their metric value have been measured. We have observed that as TelosB consumes approximately 60% less energy per CPU cycle as compared to MICAz platform. The total energy consumed by ciphers on is lesser than MICAz thus resulting to comparatively higher metric value for TelosB. It has been shown that the least energy of 0.0123 mJ per block is consumed by TEA while LED-64 consumes 2700% (26.9 times) higher. Taking into consideration the secu-rity of these ciphers, the MSEC for these algorithms are -97.69 and -0.75 respectively. Comparisons show that based on MSEC, AES is the most optimal cipher on TelosB as well with MSEC value of 73.3. The comparison between the simulation on Avrora for and the actual realization on a hardware mote has shown that the two results are similar. A deeper study of the lightweight algorithms has also shown that they innovatively mix the various stages of a traditional SPN (Substitution Permutation Network) based cipher like AES. In this thesis, one such new algorithm called LEA (Lightweight Encryp-tion Algorithm) has been proposed which has a skeletal structure similar to AES. The proposed algorithm uses AES S- box for byte-wise substitution and AES key scheduling to generate the round keys. Further, the ShiftRows in AES is replaced by StateTranspose step and a new non-linear step called MixBits has been introduced in this cipher which performs bit-wise operations like bitwise shifts and XOR on the input blocks to increase the diffusion property of the cipher. The MixBits step is analogous to the MixColums step of AES. In addition, for improved security, it uses key whitening as proposed in DESX. Based on observations for DESX, the effective key length of LEA comes down to 191 bits which gives a MSEC value of 154.38 while consuming 0.0219 mJ per block on TelosB platform. We have observed that as an effect of the MixBits step, LEA has large number of active S-boxes per round and the properties of confusion and diffusion are spread across all the output bytes by end of round 3 of the cipher. In order to perform the preliminary cryptanalysis on LEA, a byte- wise randomness test was conducted for LEA

IoT networks serve as a way for various devices interconnected over the internet to exchange data with each other and with other services. Most smartphones, laptops, and other communication devices are connected to the cloud today, making data accessible to everyone. There are many applications for IoT, from smart IoT applications to industrial products. Encryption is one of the best ways to make IoT networks secure since so much data is being transferred. A lightweight block cipher is one of the most sophisticated means for overcoming the security problems inherent to IoT networks. Because of the limited resources available to nodes, classical cryptography methods are costly and inefficient. In this paper, we have compared the systems, we have found that these modifications were made to the original AES algorithm, while the original algorithm security remains robust, the modified AES algorithm remains lightweight and faster, providing more satisfaction for embedding in IoT devices and sensors that consume little power. Furthermore, this algorithm enhanced the AES-ECC hybrid encryption system, which has good flexibility and versatility, and optimized the design of the ECC function according to the characteristics of wireless sensor networks. Using Salsa20/12 stream cipher, the texture images can be encrypted using bit masking and permutation procedures and as part of a new scheme for encrypting 3D objects, which complements the existing methods for 3D object encryption. With PLIE implemented in Python, the encryption time was approximately 50% faster than that of AES using the throughput increase, faster encryption time, and minimal complexity.