scholarly journals Catalog and Illustrative Examples of Lightweight Cryptographic Primitives

2021 ◽  
pp. 21-47
Author(s):  
Aleksandra Mileva ◽  
Vesna Dimitrova ◽  
Orhun Kara ◽  
Miodrag J. Mihaljević
Keyword(s):  
Stream Cipher ◽  
Block Cipher ◽  
Security Analysis ◽  
Stream Ciphers ◽  
Security Evaluation ◽  
Cryptographic Primitives ◽  
Internal States ◽  
Lightweight Block Cipher ◽  
Hardware Performance

AbstractThe main objective of this chapter is to offer to practitioners, researchers and all interested parties a brief categorized catalog of existing lightweight symmetric primitives with their main cryptographic features, ultimate hardware performance, and existing security analysis, so they can easily compare the ciphers or choose some of them according to their needs. Certain security evaluation issues have been addressed as well. In particular, the reason behind why modern lightweight block cipher designs have in the last decade overwhelmingly dominated stream cipher design is analyzed in terms of security against tradeoff attacks. It turns out that it is possible to design stream ciphers having much smaller internal states.

scholarly journals Hardware optimizations of stream cipher rabbit

2011 ◽  
Vol 50 (1) ◽  
pp. 87-101
Author(s):  
Jozef Tomecek
Keyword(s):  
Stream Cipher ◽  
Stream Ciphers ◽  
Optimization Techniques ◽  
Cryptographic Primitives ◽  
Trade Offs ◽  
Algorithm Comparison ◽  
Form Part ◽  
Hardware Optimizations ◽  
Hardware Performance

ABSTRACT Stream ciphers form part of cryptographic primitives focused on privacy. Synchronous, symmetric and software-oriented stream cipher Rabbit is member of final portfolio of European Union's eStream project. Although it was designed to perform well in software, employed operations seem to compute effi­ciently in hardware. 128-bit security, with no known security weaknesses is claimed by Rabbit's designers. Since hardware performance of Rabbit was only estimated in the proposal of algorithm, comparison of direct and optimized FPGA im­plementations of Rabbit stream cipher is presented, identifying algorithm bot­tlenecks, discussing optimization techniques applied to algorithm computations, along with key area/time trade-offs.

Security Analysis of Cipher ICEBERG against Bit-pattern Based Integral Attack

2016 ◽  
Vol 12 (2) ◽  
pp. 60-71 ◽  
Author(s):  
Yuechuan Wei ◽  
Yisheng Rong ◽  
Xu An Wang
Keyword(s):  
Block Cipher ◽  
Security Analysis ◽  
Block Ciphers ◽  
Significant Progress ◽  
Cryptographic Primitives ◽  
Lightweight Block Cipher ◽  
Balance Property ◽  
Integral Attack ◽  
Final Round ◽  
Made In

Significant progress in the development of lightweight symmetric cryptographic primitives has been made in recent years. Security of ciphers against current cryptanalysis methods should be carefully evaluated. Integral attack is one of the most effective attacks against block ciphers. However, traditional integral attack based on byte or word is not available for a bit-oriented cipher. Bit-pattern based integral attack technique, introduced by Z'aba et al. addresses this issue to some extent. In this paper, bit-pattern based integral attack is applied to ICEBERG—a lightweight block cipher efficient in reconfigurable hard-ware. By tracing the propagation of the plaintext structure at bit-level, the balance property is obtained and then key guesses are verified. The result shows that 3, 4 and 5 rounds ICEBERG are not immune to this attack. All attacks presented in this paper manage to recover the full subkeys of the final round.

scholarly journals Lightweight Block Cipher Security Evaluation Based on Machine Learning Classifiers and Active S-Boxes

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 134052-134064
Author(s):  
Ting Rong Lee ◽  
Je Sen Teh ◽  
Norziana Jamil ◽  
Jasy Liew Suet Yan ◽  
Jiageng Chen
Keyword(s):  
Machine Learning ◽  
Block Cipher ◽  
Security Evaluation ◽  
Machine Learning Classifiers ◽  
Learning Classifiers ◽  
Lightweight Block Cipher

scholarly journals Tradeoff Attacks on Symmetric Ciphers

2021 ◽  
Author(s):  
Orhun Kara
Keyword(s):  
Internal State ◽  
Security Analysis ◽  
Stream Ciphers ◽  
Open Problems ◽  
Key Recovery ◽  
State Recovery ◽  
Internal States ◽  
Symmetric Ciphers ◽  
Iot Devices ◽  
State Size

Tradeoff attacks on symmetric ciphers can be considered as the generalization of the exhaustive search. Their main objective is reducing the time complexity by exploiting the memory after preparing very large tables at a cost of exhaustively searching all the space during the precomputation phase. It is possible to utilize data (plaintext/ciphertext pairs) in some cases like the internal state recovery attacks for stream ciphers to speed up further both online and offline phases. However, how to take advantage of data in a tradeoff attack against block ciphers for single key recovery cases is still unknown. We briefly assess the state of art of tradeoff attacks on symmetric ciphers, introduce some open problems and discuss the security criterion on state sizes. We discuss the strict lower bound for the internal state size of keystream generators and propose more practical and fair bound along with our reasoning. The adoption of our new criterion can break a fresh ground in boosting the security analysis of small keystream generators and in designing ultra-lightweight stream ciphers with short internal states for their usage in specially low source devices such as IoT devices, wireless sensors or RFID tags.

scholarly journals Encryption Efficiency Analysis and Security Evaluation of RC6 Block Cipher for Digital Images

2007 ◽  
Vol 3 (1) ◽  
Author(s):  
Osama Salah Faragallah ◽  
Hossam El-din Hussien Ahmed ◽  
Hossam El-din Hussien Ahmed ◽  
Hossam El-din Hussien Ahmed ◽  
Hamdy Mohamed Kalash ◽  
...  
Keyword(s):  
Real Time ◽  
Block Cipher ◽  
Digital Images ◽  
Security Analysis ◽  
Experimental Tests ◽  
Design Parameters ◽  
Security Evaluation ◽  
Secret Key ◽  
Key Length ◽  
Differential Attacks

This paper investigates the encryption efficiency of RC6 block cipher application to digital images, providing a new mathematical measure for encryption efficiency, which we will call the encryption quality instead of visual inspection, The encryption quality of RC6 block cipher is investigated among its several design parameters such as word size, number of rounds, and secret key length and the optimal choices for the best values of such design parameters are given. Also, the security analysis of RC6 block cipher for digital images is investigated from strict cryptographic viewpoint. The security estimations of RC6 block cipher for digital images against brute-force, statistical, and differential attacks are explored. Experiments are made to test the security of RC6 block cipher for digital images against all aforementioned types of attacks. Experiments and results verify and prove that RC6 block cipher is highly secure for real-time image encryption from cryptographic viewpoint. Thorough experimental tests are carried out with detailed analysis, demonstrating the high security of RC6 block cipher algorithm. So, RC6 block cipher can be considered to be a real-time secure symmetric encryption for digital images.

scholarly journals Integral Distinguishers of the Full-Round Lightweight Block Cipher SAT_Jo

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xueying Qiu ◽  
Yongzhuang Wei ◽  
Samir Hodzic ◽  
Enes Pasalic
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Time Complexity ◽  
Block Cipher ◽  
Security Analysis ◽  
Mixed Integer ◽  
Substitution Boxes ◽  
Lightweight Block Cipher ◽  
The One

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

scholarly journals Comprehensive security analysis of CRAFT

2020 ◽  
pp. 290-317
Author(s):  
Hosein Hadipour ◽  
Sadegh Sadeghi ◽  
Majid M. Niknam ◽  
Ling Song ◽  
Nasour Bagheri
Keyword(s):  
Detailed Analysis ◽  
Differential Effect ◽  
Block Cipher ◽  
Security Analysis ◽  
Linear Cryptanalysis ◽  
Zero Correlation ◽  
Efficient Protection ◽  
Lightweight Block Cipher ◽  
Insight Into ◽  
Partitioning Technique

CRAFT is a lightweight block cipher, designed to provide efficient protection against differential fault attacks. It is a tweakable cipher that includes 32 rounds to produce a ciphertext from a 64-bit plaintext using a 128-bit key and 64-bit public tweak. In this paper, compared to the designers’ analysis, we provide a more detailed analysis of CRAFT against differential and zero-correlation cryptanalysis, aiming to provide better distinguishers for the reduced rounds of the cipher. Our distinguishers for reduced-round CRAFT cover a higher number of rounds compared to the designers’ analysis. In our analysis, we observed that, for any number of rounds, the differential effect of CRAFT has an extremely higher probability compared to any differential trail. As an example, while the best trail for 11 rounds of the cipher has a probability of at least 2−80, we present a differential with probability 2−49.79, containing 229.66 optimal trails, all with the same optimum probability of 2−80. Next, we use a partitioning technique, based on optimal expandable truncated trails to provide a better estimation of the differential effect on CRAFT. Thanks to this technique, we are able to find differential distinguishers for 9, 10, 11, 12, 13, and 14 rounds of the cipher in single tweak model with the probabilities of at least 2−40.20, 2−45.12, 2−49.79, 2−54.49, 2−59.13, and 2−63.80, respectively. These probabilities should be compared with the best distinguishers provided by the designers in the same model for 9 and 10 rounds of the cipher with the probabilities of at least 2−54.67 and 2−62.61, respectively. In addition, we consider the security of CRAFT against the new concept of related tweak zero-correlation (ZC) linear cryptanalysis and present a new distinguisher which covers 14 rounds of the cipher, while the best previous ZC distinguisher covered 13 rounds. Thanks to the related tweak ZC distinguisher for 14 rounds of the cipher, we also present 14 rounds integral distinguishers in related tweak mode of the cipher. Although the provided analysis does not compromise the cipher, we think it provides a better insight into the designing of CRAFT.

Security analysis of Khudra: a lightweight block cipher for FPGAs

2015 ◽  
Vol 9 (10) ◽  
pp. 1173-1185 ◽  
Author(s):  
Yibin Dai ◽  
Shaozhen Chen
Keyword(s):  
Block Cipher ◽  
Security Analysis ◽  
Lightweight Block Cipher

scholarly journals Atom: A Stream Cipher with Double Key Filter

2021 ◽  
pp. 5-36
Author(s):  
Subhadeep Banik ◽  
Andrea Caforio ◽  
Takanori Isobe ◽  
Fukang Liu ◽  
Willi Meier ◽  
...  
Keyword(s):  
Stream Cipher ◽  
Internal State ◽  
Common Knowledge ◽  
Basic Structure ◽  
Stream Ciphers ◽  
Security Level ◽  
Secret Key ◽  
Internal States ◽  
The Face

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however proposed the stream cipher Sprout with a Grain-like architecture, whose internal state was equal in size with its secret key and yet resistant against TMD attacks. Although Sprout had other weaknesses, it germinated a sequence of stream cipher designs like Lizard and Plantlet with short internal states. Both these designs have had cryptanalytic results reported against them. In this paper, we propose the stream cipher Atom that has an internal state of 159 bits and offers a security of 128 bits. Atom uses two key filters simultaneously to thwart certain cryptanalytic attacks that have been recently reported against keystream generators. In addition, we found that our design is one of the smallest stream ciphers that offers this security level, and we prove in this paper that Atom resists all the attacks that have been proposed against stream ciphers so far in literature. On the face of it, Atom also builds on the basic structure of the Grain family of stream ciphers. However, we try to prove that by including the additional key filter in the architecture of Atom we can make it immune to all cryptanalytic advances proposed against stream ciphers in recent cryptographic literature.

Sign in / Sign up

Export Citation Format

Share Document