64-bit Block Research Articles

Related-Key Differential Attack on Round-Reduced Bel-T-256

Bel-T is the national block cipher encryption standard of the Republic of Belarus. It operates on 128-bit blocks and uses either 128, 192 or 256-bit keys. Bel-T combines a Feistel network with a Lai-Massey scheme and it has a complex round function with 7 S-box layers. In this work, we use a Mixed Integer Linear Programming (MILP) approach to find a a related-key differential characteristic that extends for 4 rounds and 5 S-box layers ($4 \frac{5}{7}$ rounds) with probability higher than 2-128. To build an MILP model of Bel-T that a solver can practically handle, we use a partial Difference Distribution Table (DDT) based on the Hamming weight of the input and output differences. The identified differential characteristic is used to mount a key recovery attack on 5 rounds and 6 S-box layers ($5 \frac{6}{7}$ out of 8 rounds) of Bel-T-256 with 2123.28 chosen plaintexts and 2228.4 encryptions. According to the best of our knowledge, this is the first public cryptanalysis of Bel-T in the black-box attack model.

Penerapan Algoritma Skipjack Untuk Menyandikan Short Message Service

The security and confidentiality of Short Message Service (SMS) is very important for senders and recipients of messages. Generally, SMS is displayed in plain text form which can make it easy for the cryptanalyst to skipjack the message to be distributed. SMS security can be done by encrypting it based on one of the cryptographic algorithms in order to maintain the authenticity and security of messages and can make it difficult for others to know the original meaning of the SMS. Skipjack algorithm is one of cryptography algorithm that can be used for SMS encoding. The Skipjack algorithm is an electronic 64-bit codebook algorithm that converts 64-bit blocks into 64-bit blocks of output. The parameter used for encryption is 80-bit key and has 32 rounds of the encryption process and description. This study describes how SMS text encoding based on skipjack algorithm with the purpose of distributed SMS can be guaranteed to be safe and avoid misuse.

Implementasi Algoritma Data Encryption Standard Pada Penyandian Record Database

Record databases are generally still often displayed in text form as information for users, so it can facilitate cryptanalyst to access and provide opportunities to do the leak, distribute or modify the database records. One of the cryptographic algorithms used to secure data is using the DES algorithm to encrypt the data to be stored or sent. The DES algorithm belongs to a cryptographic system of symmetry and is a type of block cipher. DES operates on a 64-bit block size. DES describes 64 bits of plaintext to 64 bits of ciphertext using 56 bits of internal key (internal key) or up-key (subkey). The internal key is generated from an external key 64-bit length. This research describes the process of securing database records by encrypting it based on DES algorithm, resulting in text record databases in the form of passwords that are difficult to understand and understand by others. This is done in an attempt to minimize the misuse of database records.

Compact and High Speed Architectures of KASUMI Block Cipher

This paper proposes highly compact and high speed hardware architectures of 64-bit KASUMI block cipher for wide range of wireless applications. A novel methodology is adopted for low area KASUMI implementation employing a single combined substitution block (CSB) for S9 and S7 substitution functions in FI/FO function. The CSB performs S9/S7 transformations and re-utilizes the common combinational logic of AND and AND–XOR gates whereas computations of CSB logic expressions are performed using parallel hierarchy of ANDs/AND-XORs. This scheme substantially reduces the area generating moderate throughput values for compact KASUMI architecture. FPGA implementation with Xilinx Virtex 7 and ASIC implementation using IC Design Compiler, 0.18 µm at 1.8 V constituted 126 CLB slices/2.64 k gates having throughput values of 180/122 Mbps respectively. For high speed KASUMI implementation, the optimized combinational logic methdodology of compact architecture is extended to individual S9/S7 substitution functions and 2 × pipeline schemes are proposed. The odd and even round functions FO and FL are configured for simultaneous operations and path delays are reduced using XOR logic modifications thereby producing high throughput and high efficiency values. Hardware implementations yielded an area of 1619 CLB slices/52.7 k gates attaining throughput values of 16.9/16.1 Gbps for high speed KASUMI architecture I whereas KASUMI architecture II constituted 1847 CLB slices/59.8 k gates attaining very high throughput of 27.5/26.6 Gbps with FPGA and ASICs respectively. A detailed design and performance analysis of proposed KASUMI architectures is described.

Related-key impossible differential cryptanalysis on lightweight cipher TWINE

Lightweight block cipher is usually used in smart environment to protect confidentiality as well as to authentication. TWINE is a lightweight block cipher proposed by Japan scholar in SAC 2012 suits for kinds of platform from software to hardware. The cipher algorithm iterates a generalized Feistel structure with an improved block shuffle each sub-block includes an SP type round function. It with 64-bit block size, supports 80/128-bit key size and has 36 rounds iteration. This paper further investigates the security of TWINE, presents a new related-key impossible differential attack on reduced-round TWINE with 80-bit key (i.e. TWINE-80). By choosing the relations of keys carefully and exploring an equivalent structure of TWINE based on analysis of the encryption process, we show a 17-round related-key differential and then construct a 15-round related-key impossible differential trial. By using this trail, a 24-round related-key impossible differential attack on TWINE-80 is conducted. The result shows that the known impossible differential attack on TWINE-80 can be improved by one round.

Impossible Differential Attack on Reduced Round SPARX-128/256

SPARX-128/256 is one of the two versions of the SPARX-128 block cipher family. It has 128-bit block size and 256-bit key size. SPARX has been developed using ARX-based S-boxes with the aim of achieving provable security against single-trail differential and linear cryptanalysis. In this letter, we propose 20-round impossible differential distinguishers for SPARX-128. Then, we utilize these distinguishers to attack 24 rounds (out of 40 rounds) of SPARX-128/256. Our attack has time complexity of 2232 memory accesses, memory complexity of 2160.81 128-bit blocks, and data complexity of 2104 chosen plaintexts.

Breaching Security of Full Round Tiny Encryption Algorithm

Tiny encryption algorithm is a 64-bit block cipher designed by Wheeler and Needham in 1994 and attracted much of its attention due to its capability of reducing the hardware cost. In this paper, we introduced coincidence count attack at bit level, a kind of known-plaintext attack and evaluated the resistance of TEA to withstand with it. We also examined confrontation of full round TEA against bit sum attack. Furthermore, we introduced a modest algorithm based on coincidence count and bit sum concept that makes it easy to find relevant plaintext corresponding to an arbitrary cipher text with a probability of 0.93. We also presented how cipher text originated from tiny encryption algorithm can be distinguished from a random permutation of binary sequence.

Design and implementation of an ASIP-based cryptography processor for AES, IDEA, and MD5

In this paper, a new 32-bit ASIP-based crypto processor for AES, IDEA, and MD5 is designed. The instruction-set consists of both general purpose and specific instructions for the above cryptographic algorithms. The proposed architecture has nine function units and two data buses. It has also two types of 32-bit instruction formats for executing Memory Reference (M.R.), Register Reference (R.R.), and Input/Output Reference (I/O R.) instructions. The maximum achieved frequency is 166.916MHz. The encoded output results of the encryption process of a 128-bit input block are obtained after 122, 146 and 170 clock cycles for AES-128, AES-192, and AES-256, respectively. Moreover, it takes 95 clock cycles to encrypt or decrypt a 64-bit input block by using IDEA. Finally, the MD5 hash algorithm requires 469 clock cycles to generate the coded outputs for a block of 512bits. The performance of the proposed processor is compared to some previous and state-of-the-art implementations in terms of speed, latency, throughput, and flexibility.

Aplikasi Keamanan Sms Menggunakan Algoritma Rijndael

Mobile phones and smartphones providing the basic features of SMS (Short Message Service).Messages sent through SMS facility sometimes confidential, so that the necessary mechanisms to protect messages from crime. Mechanism that can be used to protect the message is to use a cryptographic algorithm Rijndael. This algorithm is a cryptographic algorithm chipher 128-bit block that has the ability to protect confidential messages. This research resulted in an application that can be used to protect the SMS message when the message is sent and received by users. Based on research conducted on the length of different messages with the same key length is obtained that the length of the message used computing time takes longer than the length of the message is the same and different key lengths.

EXPERIMENTAL DATA FOR THE IDENTIFICATION OF DYNAMIC INDICATORS OF COMING TO BLOCK OF SYMMETRIC CIPHERS RANDOM PERMUTATION

Context. The object of study of this work is the arrival processes of block symmetric ciphers to the state of a random permutation. Objective. Clarification by means of computational experiments values of dynamic parameters arrival of some modern ciphers to the state of a random permutation, which can be important when evaluating their effectiveness. Method. Methods of experiments consists in determining the differential parameters in activation ciphers (programming models) sets the input difference and the subsequent determination of the minimum number of S-boxes-activated in the first cycle of encryption, allowing to obtain the value of the differential probability of relevant indicators of resistance considered cipher. In determining the linear indicators are moving non-zero mask inputs in S-boxes, and non-zero mask their outputs. When this input is activated on one cipher byte input frame, with a byte is selected, which activates minimum number the first cycle of S-blocks. Here, the active byte (S-unit) means bytes (S-unit), by which for the pair in the input code (in the S-box) is formed non-zero input (output) the difference. Then, in the mode of encoding a complete listing of all 256 bit single-byte cipher input differences determined by the minimum number of activatable S-boxes in each of the cycles that are translated into the number of encsphering cycles required for the arrival of a random permutation cipher. A similar within the meaning of the procedure can be performed in the analysis of linear parameters using the input and output masks. Results. The results indicate that the construction of the first cyclic transformation block symmetric ciphers play an important role in ensuring the dynamic performance of the parish codes to random permutation, and significantly affect the value of the number of cycles required for the stock of their resistance. All of the (known) design of modern 128-bit block symmetric ciphers, except ciphers IDEA NXT, Kalina, Amanita and Belarusian cipher, provide dynamic performance to the arrival of a random permutation exceeding three or four cycles. Rijndael cipher is far from the leaders of the subject indicator (for the arrival of a random permutation it needs 4 cycles). Conclusions. In this paper we solve the problem clarification and confirmation via computational experiments the effectiveness of a new methodology for assessing the dynamic performance of the parish codes to random permutation. Scientific novelty of the results of the paper is that the first objective data obtained reasonable for the arrival of number of cycles to the values of a random permutation of some modern ciphers. The practical significance of the proposed methodology and presented the results is their constructivism. They allow you to perform a study of ciphering transformation cycles that achieve the maximum level of resistance ciphers.

Silicon Demonstration of Hardware Trojan Design and Detection in Wireless Cryptographic ICs

Using silicon measurements from 40 chips fabricated in Taiwan Semiconductor Manufacturing Company’s (TSMC’s) 0.35- $\mu \text{m}$ technology, we demonstrate the operation of two hardware Trojans, which leak the secret key of a wireless cryptographic integrated circuit (IC) consisting of an Advanced Encryption Standard (AES) core and an ultrawideband (UWB) transmitter (TX). With their impact carefully hidden in the transmission specification margins allowed for process variations, these hardware Trojans cannot be detected by production testing methods of either the digital or the analog part of the IC and do not violate the transmission protocol or any system-level specifications. Nevertheless, the informed adversary, who knows what to look for in the transmission power waveform, is capable of retrieving the 128-bit AES key, which is leaked with every 128-bit ciphertext block sent by the UWB TX. Moreover, through physical measurements and MATLAB simulations, we show that the attack facilitated by these hardware Trojans is robust to test equipment and communication channel noise. Finally, we experimentally evaluate the effectiveness of a popular hardware Trojan detection method, namely, statistical side-channel fingerprinting via trained one-class classifiers, in detecting the hardware Trojans introduced in our fabricated IC population.

Cryptanalysis of GOST2

GOST 28147 is a 256-bit key 64-bit block cipher developed by the USSR, later adopted by the Russian government as a national standard. In 2010, GOST was suggested to be included in ISO/IEC 18033-3, but was rejected due to weaknesses found in its key schedule. In 2015, a new version of GOST was suggested with the purpose of mitigating such attacks. In this paper, we show that similar weaknesses exist in the new version as well. More specifically, we present a fixed-point attack on the full cipher with time complexity of 2 237 encryptions. We also present a reflection attack with time complexity of 2 192 for a key that is chosen from a class of 2 224 weak keys. Finally, we discuss an impossible reflection attack which improves on exhaustive search by a factor of 2 e , and several possible related-key attacks.

Cryptanalysis of GOST2

GOST 28147 is a 256-bit key 64-bit block cipher developed by the USSR, later adopted by the Russian government as a national standard. In 2010, GOST was suggested to be included in ISO/IEC 18033-3, but was rejected due to weaknesses found in its key schedule. In 2015, a new version of GOST was suggested with the purpose of mitigating such attacks. In this paper, we show that similar weaknesses exist in the new version as well. More specifically, we present a fixed-point attack on the full cipher with time complexity of 2237 encryptions. We also present a reflection attack with time complexity of 2192 for a key that is chosen from a class of 2224 weak keys. Finally, we discuss an impossible reflection attack which improves on exhaustive search by a factor of 2e, and several possible related-key attacks.

Improved meet‐in‐the‐middle attacks on Crypton and mCrypton

This study presents several meet-in-the-middle attacks on reduced-round Crypton and mCrypton block ciphers. Using the generalised δ-set, the authors construct 5-round distinguishers on Crypton and mCrypton. Based on these distinguishers, the authors propose meet-in-the-middle attacks on 8-round Crypton and mCrypton-96/128. The attack on Crypton needs 2121 chosen plaintexts, 2132 encryptions and 2130 128-bit blocks; the attacks on mCrypton need 261 chosen plaintexts, 280 encryptions and 278 64-bit blocks. Furthermore, the attack can be extended to 9 rounds for mCrypton-128 with complexities of 261 chosen plaintexts, 2112 encryptions and 282 64-bit blocks.

Multidimensional Differential-Linear Cryptanalysis of ARIA Block Cipher

ARIA is a 128-bit block cipher that has been selected as a Korean encryption standard. Similar to AES, it is robust against differential cryptanalysis...

Systematization of a 256-Bit Lightweight Block Cipher Marvin

In a world heavily loaded by information, there is a great need for keeping specific information secure from adversaries. The rapid growth in the research field of lightweight cryptography can be seen from the list of the number of lightweight stream as well as block ciphers that has been proposed in the recent years. This paper focuses only on the subject of lightweight block ciphers. In this paper, we have proposed a new 256 bit lightweight block cipher named as Marvin, that belongs to the family of Extended LS designs.

SIT: A Lightweight Encryption Algorithm for Secure Internet of Things

The Internet of Things (IoT) being a promising technology of the future is expected to connect billions of devices. The increased number of communication is expected to generate mountains of data and the security of data can be a threat. The devices in the architecture are essentially smaller in size and low powered. Conventional encryption algorithms are generally computationally expensive due to their complexity and requires many rounds to encrypt, essentially wasting the constrained energy of the gadgets. Less complex algorithm, however, may compromise the desired integrity. In this paper we propose a lightweight encryption algorithm named as Secure IoT (SIT). It is a 64-bit block cipher and requires 64-bit key to encrypt the data. The architecture of the algorithm is a mixture of feistel and a uniform substitution-permutation network. Simulations result shows the algorithm provides substantial security in just five encryption rounds. The hardware implementation of the algorithm is done on a low cost 8-bit micro-controller and the results of code size, memory utilization and encryption/decryption execution cycles are compared with benchmark encryption algorithms. The MATLAB code for relevant simulations is available online at https://goo.gl/Uw7E0W.

The Understanding of GOST Crytography Technique

Nowadays, it is often found a wide range of the securing information. The understanding that the author wants to design is about cryptography. Cryptography is the study of the security of data or information, commonly found in transferring data. One of them is the method of GOST, GOST is an abbreviation of Gosudarstvennyi Standard or Government Standard. The algorithm is simple encryption algorithm which has some processes as many as 32 rounds and uses 64-bit block cipher with 256-bit key. GOST method also uses the S-Box 8 pieces of permanent and XOR operations and Rotate Left Shift. The author chose the GOST topic since the author wants to describe the understanding of the GOST method. The learning is presenting calculation of the encryption and decryption. The learning course is the study of cryptographic methods GOST. Learning software is also designed so that the method can be more easily understood GOST both algorithms and operations contained in this GOST method.

A new counting method to bound the number of active S-boxes in Rijndael and 3D

Security against differential and linear cryptanalysis is an essential requirement for modern block ciphers. This measure is usually evaluated by finding a lower bound for the minimum number of active S-boxes. The 128-bit block cipher AES which was adopted by National Institute of Standards and Technology (NIST) as a symmetric encryption standard in 2001 is a member of Rijndael family of block ciphers. For Rijndael, the block length and the key length can be independently specified to 128, 192 or 256 bits. It has been proved that for all variants of Rijndael the lower bound of the number of active S-boxes for any 4-round differential or linear trail is 25, and for 4r ($$r \ge 1$$rź1) rounds 25r active S-boxes is a tight bound only for Rijndael with block length 128. In this paper, a new counting method is introduced to find tighter lower bounds for the minimum number of active S-boxes for several consecutive rounds of Rijndael with larger block lengths. The new method shows that 12 and 14 rounds of Rijndael with 192-bit block length have at least 87 and 103 active S-boxes, respectively. Also the corresponding bounds for Rijndael with 256-bit block are 105 and 120, respectively. Additionally, a modified version of Rijndael-192 is proposed for which the minimum number of active S-boxes is more than that of Rijndael-192. Moreover, we extend the method to obtain a better lower bound for the number of active S-boxes for the block cipher 3D. Our counting method shows that, for example, 20 and 22 rounds of 3D have at least 185 and 205 active S-boxes, respectively.

Balanced Permutations Even–Mansour Ciphers

The r-rounds Even–Mansour block cipher is a generalization of the well known Even–Mansour block cipher to r iterations. Attacks on this construction were described by Nikolić et al. and Dinur et al. for r = 2 , 3 . These attacks are only marginally better than brute force but are based on an interesting observation (due to Nikolić et al.): for a “typical” permutation P, the distribution of P ( x ) ⊕ x is not uniform. This naturally raises the following question. Let us call permutations for which the distribution of P ( x ) ⊕ x is uniformly “balanced” — is there a sufficiently large family of balanced permutations, and what is the security of the resulting Even–Mansour block cipher? We show how to generate families of balanced permutations from the Luby–Rackoff construction and use them to define a 2 n -bit block cipher from the 2-round Even–Mansour scheme. We prove that this cipher is indistinguishable from a random permutation of { 0 , 1 } 2 n , for any adversary who has oracle access to the public permutations and to an encryption/decryption oracle, as long as the number of queries is o ( 2 n / 2 ) . As a practical example, we discuss the properties and the performance of a 256-bit block cipher that is based on our construction, and uses the Advanced Encryption Standard (AES), with a fixed key, as the public permutation.