General Method of Combining Grover and Simon for Attacking Block Ciphers

The compatibility of different quantum algorithms should be considered when these algorithms are combined.In this paper,the method of combining Grover and Simon is studied for the first time,under some preconditions or assumptions.First,we give two preconditions of applying Grover’s algorithm,which ensure that the success probability of finding the marked element is close to 1.Then,based on these two preconditions,it is found out that the success probability of the quantum algorithm for FXconstruction is far less than 1.Furthermore,we give the design method of the Oracle function,and then present the general method of combining Grover and Simon algorithm for attacking block ciphers,with success probability close to 1.

Further Analysis of Block Ciphers against Timing Attacks

Timing attacks break a cryptosystem by time measurement to recover keys. Most available countermeasures protect block ciphers based on the safety of modules. This paper gives a complete definition of timing attacks and studies the vulnerability of operations and modules on timing attacks. We present a method to transfer the security of the algorithm to that of secure operations by reduction. As a result, we hopefully tend to reconcile the provable security notions and modem cryptography with real-world implementations of block ciphers.

Improved deep learning aided key recovery framework:applications to large-state block ciphers

At the Annual International Cryptology Conference in 2019,Gohr introduced a deep learning based cryptanalysis technique applicable to the reduced-round lightweight block ciphers with a short block of SPECK32/64.One significant challenge left unstudied by Gohr's work is the implementation of key recovery attacks on large-state block ciphers based on deep learning.The purpose of this paper is to present an improved deep learning based framework for recovering keys for large-state block ciphers.First,we propose a key bit sensitivity test(KBST)based on deep learning to divide the key space objectively.Second,we propose a new method for constructing neural distinguisher combinations to improve a deep learning based key recovery framework for large-state block ciphers and demonstrate its rationality and effectiveness from the perspective of cryptanalysis.Under the improved key recovery framework,we train an efficient neural distinguisher combination for each large-state member of SIMON and SPECK and finally carry out a practical key recovery attack on the large-state members of SIMON and SPECK.Furthermore,we propose that the 13-round SIMON64 attack is the most effective approach for practical key recovery to date.Noteworthly,this is the first attempt to propose deep learning based practical key recovery attacks on18-round SIMON128,19-round SIMON128,14-round SIMON96,and 14-round SIMON64.Additionally,we enhance the outcomes of the practical key recovery attack on SPECK large-state members,which amplifies the success rate of the key recovery attack in comparison to existing results.

Continuously non-malleable codes from block ciphers in split-state model

Non-malleable code is an encoding scheme that is useful in situations where traditional error correction or detection is impossible to achieve.It ensures with high probability that decoded message is either completely unrelated or the original one,when tampering has no effect.Usually,standard version of non-malleable codes provide security against one time tampering attack.Block ciphers are successfully employed in the construction of non-malleable codes.Such construction fails to provide security when an adversary tampers the codeword more than once.Continuously non-malleable codes further allow an attacker to tamper the message for polynomial number of times.In this work,we propose continuous version of non-malleable codes from block ciphers in split-state model.Our construction provides security against polynomial number of tampering attacks and it preserves non-malleability.When the tam-pering experiment triggers self-destruct,the security of continuously non-malleable code reduces to security of the underlying leakage resilient storage.

A New Black Box Analysis of Hash Functions Based on Block Ciphers

For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and proved that 20 schemes are collision resistant.This paper improves the upper and lower bounds and make contrast with a hash constructed from a random oracle.These 20 schemes have only one kind of collision resistance upper and lower bounds.In addition, we present new advantages for finding second preimages.

ANALYSIS OF MINIMUM NUMBERS OF LINEARLY ACTIVE S-BOXES OF A CLASS OF GENERALIZED FEISTEL BLOCK CIPHERS

For a class of generalized Feistel block ciphers, an explicit formula for the minimum numbers of linearly active S-boxes of any round r is presented.

THE RESEARCH AND DESIGN OF RECONFIGURABLE COMPUTING FOR BLOCK CIPHER

This paper describes a new specialized Reconfigurable Cryptographic for Block ciphersArchitecture(RCBA).Application-specific computation pipelines can be configured according to thecharacteristics of the block cipher processing in RCBA,which delivers high performance for crypto-graphic applications.RCBA adopts a coarse-grained reconfigurable architecture that mixes the ap-propriate amount of static configurations with dynamic configurations.RCBA has been implementedbased on Altera’s FPGA,and representative algorithms of block cipher such as DES,Rijndael and RC6have been mapped on RCBA architecture successfully.System performance has been analyzed,andfrom the analysis it is demonstrated that the RCBA architecture can achieve more flexibility and ef-ficiency when compared with other implementations.

Differential Collision Attack on Reduced FOX Block Cipher

This paper presents a method for differen- tial collision attack of reduced FOX block cipher based on 4-round distinguishing property. It can be used to attack 5, 6 and 7-round FOX64 and 5-round FOX128. Our attack has a precomputation phase, but it can be obtained before attack and computed once for all. This attack on the reduced to 4-round FOX64 requires only 7 chosen plaintexts, and performs 242.8 4-round FOX64 encryptions. It could be extended to 5 （6, 7）-round FOX64 by a key exhaustive search behind the fourth round.

A fast image encryption algorithm based on only blocks in cipher text

In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simul- taneously. The cipher-text image is divided into blocks and each block has k x k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed ac- cording to the encrypted pixel＇s value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks.

A Reconfigurable Block Cryptographic Processor Based on VLIW Architecture

An Efficient and flexible implementation of block ciphers is critical to achieve information security processing.Existing implementation methods such as GPP,FPGA and cryptographic application-specific ASIC provide the broad range of support.However,these methods could not achieve a good tradeoff between high-speed processing and flexibility.In this paper,we present a reconfigurable VLIW processor architecture targeted at block cipher processing,analyze basic operations and storage characteristics,and propose the multi-cluster register-file structure for block ciphers.As for the same operation element of block ciphers,we adopt reconfigurable technology for multiple cryptographic processing units and interconnection scheme.The proposed processor not only flexibly accomplishes the combination of multiple basic cryptographic operations,but also realizes dynamic configuration for cryptographic processing units.It has been implemented with0.18μm CMOS technology,the test results show that the frequency can reach 350 MHz.and power consumption is 420 mw.Ten kinds of block and hash ciphers were realized in the processor.The encryption throughput of AES,DES,IDEA,and SHA-1 algorithm is1554 Mbps,448Mbps,785 Mbps,and 424 Mbps respectively,the test result shows that our processor's encryption performance is significantly higher than other designs.

LBC-IoT: Lightweight Block Cipher for IoT Constraint Devices

With the new era of the Internet of Things(IoT)technology,many devices with limited resources are utilized.Those devices are susceptible to a signicant number of new malware and other risks emerging rapidly.One of the most appropriate methods for securing those IoT applications is cryptographic algorithms,as cryptography masks information by eliminating the risk of collecting any meaningful information patterns.This ensures that all data communications are private,accurate,authenticated,authorized,or nonrepudiated.Since conventional cryptographic algorithms have been developed specically for devices with limited resources;however,it turns out that such algorithms are not ideal for IoT restricted devices with their current conguration.Therefore,lightweight block ciphers are gaining popularity to meet the requirements of low-power and constrained devices.A new ultra-lightweight secret-key block-enciphering algorithm named“LBC-IoT”is proposed in this paper.The proposed block length is 32-bit supporting key lengths of 80-bit,and it is mainly based on the Feistel structure.Energy-efcient cryptographic features in“LBC-IoT”include the use of simple functions(shift,XOR)and small rigid substitution boxes(4-bit-S-boxes).Besides,it is immune to different types of attacks such as linear,differential,and side-channel as well as exible in terms of implementation.Moreover,LBC-IoT achieves reasonable performance in both hardware and software compared to other recent algorithms.LBC-IoT’s hardware implementation results are very promising(smallest ever area“548”GE)and competitive with today’s leading lightweight ciphers.LBC-IoT is also ideally suited for ultra-restricted devices such as RFID tags.

Security Analysis and Enhanced Design of a Dynamic Block Cipher

There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution of S-box,thus disordering the internal structure of data blocks by four steps of matrix transformation.Then,the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function.The dynamic key was finally generated by using LFSR,which improved the stochastic characters of secret key in each of round of iteration.The safety performance of proposed algorithm was analyzed by simulation test.The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security.Meanwhile,the proposed algorithm has highly scalability,the dimension of S-box and the number of register can be dynamically extended according to the security requirement.

Non-Associative Algebra Redesigning Block Cipher with Color Image Encryption

The substitution box(S-box)is a fundamentally important component of symmetric key cryptosystem.An S-box is a primary source of non-linearity in modern block ciphers,and it resists the linear attack.Various approaches have been adopted to construct S-boxes.S-boxes are commonly constructed over commutative and associative algebraic structures including Galois fields,unitary commutative rings and cyclic and non-cyclic finite groups.In this paper,first a non-associative ring of order 512 is obtained by using computational techniques,and then by this ring a triplet of 8×8 S-boxes is designed.The motivation behind the designing of these S-boxes is to upsurge the robustness and broaden the key space due to non-associative and noncommutative behavior of the algebraic structure under consideration.A novel color image encryption application is anticipated in which initially these 3 S-boxes are being used to produce confusion in three layers of a standard RGB image.However,for the sake of diffusion 3D Arnold chaotic map is used in the proposed encryption scheme.A comparison with some of existing chaos and S-box dependent color image encryption schemes specs the performance results of the anticipated RGB image encryption and observed as approaching the standard prime level.

Designing Pair of Nonlinear Components of a Block Cipher over Gaussian Integers

In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Gaussian integers(GI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.But the prime field dependent on the Elliptic curve(EC)provides one S-box at a time by fixing three parameters a,b,and p.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.

An Innovative Technique for Constructing Highly Non-Linear Components of Block Cipher for Data Security against Cyber Attacks

The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptosystems use substitution-boxes.Nowadays,data privacy has become a key concern for consumers who transfer sensitive data from one place to another.To address these problems,many companies rely on cryptographic techniques to secure data from illegal activities and assaults.Among these cryptographic approaches,AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box(S-box).The S-box disguises the relationship between cipher text and the key to guard against cipher attacks.The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box.Therefore,various researchers have employed different techniques to construct high order non-linear S-box.This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256.The motivation for this work is to study the symmetric group and coset graphs.The authors have performed various analyses against conventional security criteria such as nonlinearity,differential uniformity,linear probability,the bit independence criterion,and the strict avalanche criterion to determine its high cryptographic strength.To evaluate its image application performance,the proposed S-box is also used to encrypt digital images.The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks.

A Block Cipher Algorithm Based on Magic Square for Secure E-bank Systems

Nowadays the E-bank systems witnessed huge growth due to the huge developments in the internet and technologies.The transmitted information represents crucial information that is exposed to various kinds of attacks.This paper presents a new block cipher technique to provide security to the transmitted information between the customers and the ebank systems.The proposed algorithm consists of 10 rounds,each round involves 5 operations.The operations involve Add round key,Sub bytes,Zigzag method,convert to vector,and Magic Square of order 11.The purpose of this algorithm is to make use of the complexity of the Magic Square algorithm,the speed of addition operation,the confusion provided by the zigzag,using these operations with Galois field 28 GF(28),and repeating these operations for several rounds to build fast high secure encryption algorithm.This algorithm is designed to provide fast with high complexity and security which is suitable to encrypt the data that is transmitted over the internet.Speed,complexity,and The National Institute of Standards and Technology Framework NIST suite tests were done.The complexity of the proposed algorithm is=((256)32)r+1∗((256)89)r+1+(256)121.The proposed technique gives higher speed and security in the encryption and decryption phases,according to the results of the experiments.The degree of randomness has grown by 31.8 percent.Due to a decrease in the time of encrypting and decrypting,as well as the usage of the central processing unit(CPU),efficiency is improved.The encryption process throughput is enhanced by 13%,while the decryption process throughput is increased by 11.6 percent with the recommended approach.

Nonlinear Components of a Block Cipher over Eisenstein Integers

In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves,chaotic maps,and Gaussian integers has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Eisenstein integers(EI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.However,in the same way,by taking three fixed parameters only one S-box is obtained through a prime field-dependent Elliptic curve(EC),chaotic maps,and Gaussian integers.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.

Temperature-Triggered Hardware Trojan Based Algebraic Fault Analysis of SKINNY-64-64 Lightweight Block Cipher

SKINNY-64-64 is a lightweight block cipher with a 64-bit block length and key length,and it is mainly used on the Internet of Things(IoT).Currently,faults can be injected into cryptographic devices by attackers in a variety of ways,but it is still difficult to achieve a precisely located fault attacks at a low cost,whereas a Hardware Trojan(HT)can realize this.Temperature,as a physical quantity incidental to the operation of a cryptographic device,is easily overlooked.In this paper,a temperature-triggered HT(THT)is designed,which,when activated,causes a specific bit of the intermediate state of the SKINNY-64-64 to be flipped.Further,in this paper,a THT-based algebraic fault analysis(THT-AFA)method is proposed.To demonstrate the effectiveness of the method,experiments on algebraic fault analysis(AFA)and THT-AFA have been carried out on SKINNY-64-64.In the THT-AFA for SKINNY-64-64,it is only required to activate the THT 3 times to obtain the master key with a 100%success rate,and the average time for the attack is 64.57 s.However,when performing AFA on this cipher,we provide a relation-ship between the number of different faults and the residual entropy of the key.In comparison,our proposed THT-AFA method has better performance in terms of attack efficiency.To the best of our knowledge,this is the first HT attack on SKINNY-64-64.

An Improved Differential Fault Analysis on Block Cipher KLEIN-64

KLEIN-64 is a lightweight block cipher designed for resource-constrained environment,and it has advantages in software performance and hardware implementation.Recent investigation shows that KLEIN-64 is vulnerable to differential fault attack(DFA).In this paper,an improved DFA is performed to KLEIN-64.It is found that the differential propagation path and the distribution of the S-box can be fully utilized to distinguish the correct and wrong keys when a half-byte fault is injected in the 10th round.By analyzing the difference matrix before the last round of S-box,the location of fault injection can be limited to a small range.Thus,this improved analysis can greatly improve the attack efficiency.For the best case,the scale of brute-force attack is only 256.While for the worst case,the scale of brute-force attack is far less than 232 with another half byte fault injection,and the probability for this case is 1/64.Furthermore,the measures for KLEIN-64 in resisting the improved DFA are proposed.

A Chaotic Block Encryption Scheme Based on the Piecewise Nonlinear Map

In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-dependent shill approach permated the plain-text block and then using the classical chaotic masking technique encrypted the plain-text block. Simulation results show that the proposed algorithm has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know plaintext attacks and chosen plain-text attacks.