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.

Physical Layer Encryption of OFDM-PON Based on Quantum Noise Stream Cipher with Polar Code

Orthogonal frequency division multiplexing passive optical network(OFDM-PON) has superior anti-dispersion property to operate in the C-band of fiber for increased optical power budget. However,the downlink broadcast exposes the physical layer vulnerable to the threat of illegal eavesdropping. Quantum noise stream cipher(QNSC) is a classic physical layer encryption method and well compatible with the OFDM-PON. Meanwhile, it is indispensable to exploit forward error correction(FEC) to control errors in data transmission. However, when QNSC and FEC are jointly coded, the redundant information becomes heavier and thus the code rate of the transmitted signal will be largely reduced. In this work, we propose a physical layer encryption scheme based on polar-code-assisted QNSC. In order to improve the code rate and security of the transmitted signal, we exploit chaotic sequences to yield the redundant bits and utilize the redundant information of the polar code to generate the higher-order encrypted signal in the QNSC scheme with the operation of the interleaver.We experimentally demonstrate the encrypted 16/64-QAM, 16/256-QAM, 16/1024-QAM, 16/4096-QAM QNSC signals transmitted over 30-km standard single mode fiber. For the transmitted 16/4096-QAM QNSC signal, compared with the conventional QNSC method, the proposed method increases the code rate from 0.1 to 0.32 with enhanced security.

NEURAL NETWORK MODELS FOR DESIGN OF BLOCK CIPHER SYSTEM

In this paper, a class of block cipher systems having asymptotically perfectsecrecy is constructed by using the neural network models modified from the Hopfieldmodel.

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.

A FRAMEWORK FOR REAL-VALUED CIPHER SYSTEMS

设计的大多数零系统远因此是珍视二进制代码或珍视整数的零系统。他们的安全依靠单程的功能存在的假设。尽管单程的功能的存在还没被证明，很密码的研究人员相信单程的功能存在。另外，单程的功能的许多候选人被建议了。因此，为开发真实值的零系统的关键步是定义真实单程的功能；为他们建议候选人。在这篇论文，基于在真实的地上的计算复杂性理论，我们给真实单程的功能的二个定义；一个人为数字单程的功能；其它为一般单程的功能。单程的功能的这二个班的候选人也被建议。而且，我们在场证明的二个例子两数字单程的功能的候选人；一般单程的函数能被使用构造安全的真实值的零系统。

An Efficient Technique to Prevent Data Misuse with Matrix Cipher Encryption Algorithms

Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form.Cloud cryptography is a data encryption mechanism that consists of different steps and prevents the attacker from misusing the data.This paper has developed an efficient algorithm to protect the data from invaders and secure the data from misuse.If this algorithm is applied to the cloud network,the attacker will not be able to access the data.To encrypt the data,the values of the bytes have been obtained by converting the plain text to ASCII.A key has been generated using the Non-Deterministic Bit Generator(NRBG)mechanism,and the key is XNORed with plain text bits,and then Bit toggling has been implemented.After that,an efficient matrix cipher encryption algorithm has been developed,and this algorithm has been applied to this text.The capability of this algorithm is that with its help,a key has been obtained from the plain text,and only by using this key can the data be decrypted in the first steps.A plain text key will never be used for another plain text.The data has been secured by implementing different mechanisms in both stages,and after that,a ciphertext has been obtained.At the end of the article,the latest technique will be compared with different techniques.There will be a discussion on how the present technique is better than all the other techniques;then,the conclusion will be drawn based on comparative analysis.

Enhanced Parallelized DNA-Coded Stream Cipher Based on Multiplayer Prisoners’Dilemma

Data encryption is essential in securing exchanged data between connected parties.Encryption is the process of transforming readable text into scrambled,unreadable text using secure keys.Stream ciphers are one type of an encryption algorithm that relies on only one key for decryption and as well as encryption.Many existing encryption algorithms are developed based on either a mathematical foundation or on other biological,social or physical behaviours.One technique is to utilise the behavioural aspects of game theory in a stream cipher.In this paper,we introduce an enhanced Deoxyribonucleic acid(DNA)-coded stream cipher based on an iterated n-player prisoner’s dilemma paradigm.Our main goal is to contribute to adding more layers of randomness to the behaviour of the keystream generation process;these layers are inspired by the behaviour of multiple players playing a prisoner’s dilemma game.We implement parallelism to compensate for the additional processing time that may result fromadding these extra layers of randomness.The results show that our enhanced design passes the statistical tests and achieves an encryption throughput of about 1,877 Mbit/s,which makes it a feasible secure stream cipher.

Split-n-Swap: A New Modification of the Twofish Block Cipher Algorithm

Securing digital data from unauthorized access throughout its entire lifecycle has been always a critical concern.A robust data security system should protect the information assets of any organization against cybercriminal activities.The Twofish algorithm is one of the well-known symmetric key block cipher cryptographic algorithms and has been known for its rapid convergence.But when it comes to security,it is not the preferred cryptographic algorithm to use compared to other algorithms that have shown better security.Many applications and social platforms have adopted other symmetric key block cipher cryptographic algorithms such as the Advanced Encryption Standard(AES)algorithm to construct their main security wall.In this paper,a new modification for the original Twofish algorithm is proposed to strengthen its security and to take advantage of its fast convergence.The new algorithm has been named Split-n-Swap(SnS).Performance analysis of the new modification algorithm has been performed using different measurement metrics.The experimental results show that the complexity of the SnS algorithm exceeds that of the original Twofish algorithm while maintaining reasonable values for encryption and decryption times as well as memory utilization.A detailed analysis is given with the strength and limitation aspects of the proposed algorithm.

Asymmetric Key Cryptosystem for Image Encryption by Elliptic Curve over Galois Field GF(2^(n))

Protecting the integrity and secrecy of digital data transmitted through the internet is a growing problem.In this paper,we introduce an asymmetric key algorithm for specifically processing images with larger bit values.To overcome the separate flaws of elliptic curve cryptography(ECC)and the Hill cipher(HC),we present an approach to picture encryption by combining these two encryption approaches.In addition,to strengthen our scheme,the group laws are defined over the rational points of a given elliptic curve(EC)over a Galois field(GF).The exclusive-or(XOR)function is used instead of matrix multiplication to encrypt and decrypt the data which also refutes the need for the inverse of the key matrix.By integrating the inverse function on the pixels of the image,we have improved system security and have a wider key space.Furthermore,through comprehensive analysis of the proposed scheme with different available analyses and standard attacks,it is confirmed that our proposed scheme provides improved speed,security,and efficiency.

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.

CeTrivium:A Stream Cipher Based on Cellular Automata for Securing Real-Time Multimedia Transmission

Due to their significant correlation and redundancy,conventional block cipher cryptosystems are not efficient in encryptingmultimedia data.Streamciphers based onCellularAutomata(CA)can provide amore effective solution.The CA have recently gained recognition as a robust cryptographic primitive,being used as pseudorandom number generators in hash functions,block ciphers and stream ciphers.CA have the ability to perform parallel transformations,resulting in high throughput performance.Additionally,they exhibit a natural tendency to resist fault attacks.Few stream cipher schemes based on CA have been proposed in the literature.Though,their encryption/decryption throughput is relatively low,which makes them unsuitable formultimedia communication.Trivium and Grain are efficient stream ciphers that were selected as finalists in the eSTREAM project,but they have proven to be vulnerable to differential fault attacks.This work introduces a novel and scalable stream cipher named CeTrivium,whose design is based on CA.CeTrivium is a 5-neighborhood CA-based streamcipher inspired by the designs of Trivium and Grain.It is constructed using three building blocks:the Trivium(Tr)block,the Nonlinear-CA(NCA)block,and the Nonlinear Mixing(NM)block.The NCA block is a 64-bit nonlinear hybrid 5-neighborhood CA,while the Tr block has the same structure as the Trivium stream cipher.The NM block is a nonlinear,balanced,and reversible Boolean function that mixes the outputs of the Tr and NCA blocks to produce a keystream.Cryptanalysis of CeTrivium has indicated that it can resist various attacks,including correlation,algebraic,fault,cube,Meier and Staffelbach,and side channel attacks.Moreover,the scheme is evaluated using histogramand spectrogramanalysis,aswell as several differentmeasurements,including the correlation coefficient,number of samples change rate,signal-to-noise ratio,entropy,and peak signal-to-noise ratio.The performance of CeTrivium is evaluated and compared with other state-of-the-art techniques.CeTrivium outperforms them in terms of encryption throughput while maintaining high security.CeTrivium has high encryption and decryption speeds,is scalable,and resists various attacks,making it suitable for multimedia communication.

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.

Improved Cloud Storage Encryption Using Block Cipher-Based DNA Anti-Codify Model

When it comes to data storage,cloud computing and cloud storage providers play a critical role.The cloud data can be accessed from any location with an internet connection.Additionally,the risk of losing privacy when data is stored in a cloud environment is also increased.A variety of security techniques are employed in the cloud to enhance security.In this paper,we aim at maintaining the privacy of stored data in cloud environment by implementing block-based modelling to boost the privacy level with Anti-Codify Technique(ACoT)and block cipher-based algorithms.Initially,the cipher text is generated using Deoxyribo Nucleic Acid(DNA)model.Block-cipher-based encryption is used by ACoT,but the original encrypted file and its extension are broken up into separate blocks.When the original file is broken up into two separate blocks,it raises the security level and makes it more difficult for outsiders to cloud data access.ACoT improves the security and privacy of cloud storage data.Finally,the fuzzy-based classification is used that stores various access types in servers.The simulation results shows that the ACoT-DNA method achieves higher entropy against various block size with reduced computational cost than existing methods.

An Improved Pairing-Free Ciphertext Policy Framework for IoT

Internet of Things(IoT)enables devices to get connected to the internet.Once they are connected,they behave as smart devices thereby releasing sensitive data periodically.There is a necessity to preserve the confidentiality and integrity of this data during transmission in public communication channels and also permitting only legitimate users to access their data A key challenge of smart networks is to establish a secure end-to-end data communication architecture by addressing the security vulnerabilities of data users and smart devices.The objective of this research work is to create a framework encompassing Ciphertext policy Attribute-based Encryption scheme using block encryption and BLAKE hashing technique.An improved Pairing-Free-Ciphertext policy Attribute-based encryption algorithm has been developed to overcome the aforementioned challenges.Further,a comparative study has been performed between the proposed scheme and the different encryption algorithms.It is found that the proposed scheme scores well over the already existing schemes.The scheme is evaluated in terms of execution time and communication overhead.The robustness of the proposed scheme is also analyzed from the perspective of several security goals.

基于时变互耦合双混沌系统的轻量级序列密码

文章针对资源受限的物联网环境下的数据加密传输问题,设计了一种基于时变互耦合双混沌系统的轻量级序列密码。以Tent和Arnold混沌映射为基础,通过引入累加器和耦合项,构造一种用于序列密码内部状态更新的时变双混沌系统,基于位操作,对密钥流输出部分进行设计。文章对算法的基本运算、参数、精度、实现方式和策略进行设计并在FPGA上实现,硬件资源消耗为2370个等效门,密钥流输出速率为1.68 bit/clk。分析表明,该密码具有良好的安全性和抗攻击能力,与ISO/IEC标准的轻量级序列密码相比,安全性、资源消耗和吞吐量均有显著优势。

Two-dimensional-lag complex logistic map with complex parameters and its encryption application

With the rapid development of internet technology,security protection of information has become more and more prominent,especially information encryption.Considering the great advantages of chaotic encryption,we propose a 2D-lag complex logistic map with complex parameters(2D-LCLMCP)and corresponding encryption schemes.Firstly,we present the model of the 2D-LCLMCP and analyze its chaotic properties and system stability through fixed points,Lyapunov exponent,bifurcation diagram,phase diagram,etc.Secondly,a block cipher algorithm based on the 2D-LCLMCP is proposed,the plaintext data is preprocessed using a pseudorandom sequence generated by the 2D-LCLMCP.Based on the generalized Feistel cipher structure,a round function F is constructed using dynamic S-box and DNA encoding rules as the core of the block cipher algorithm.The generalized Feistel cipher structure consists of two F functions,four XOR operations,and one permutation operation per round.The symmetric dynamic round keys that change with the plaintext are generated by the 2D-LCLMCP.Finally,experimental simulation and performance analysis tests are conducted.The results show that the block cipher algorithm has low complexit,good diffusion and a large key space.When the block length is 64 bits,only six rounds of encryption are required to provide sufficient security and robustness against cryptographic attacks.

Enhancing the Trustworthiness of 6G Based on Trusted Multi-Cloud Infrastructure:A Practice of Cryptography Approach

Due to the need for massive device connectivity,low communication latency,and various customizations in 6G architecture,a distributed cloud deployment approach will be more relevant to the space-air-ground-sea integrated network scenario.However,the openness and heterogeneity of the 6G network cause the problems of network security.To improve the trustworthiness of 6G networks,we propose a trusted computing-based approach for establishing trust relationships inmulti-cloud scenarios.The proposed method shows the relationship of trust based on dual-level verification.It separates the trustworthy states of multiple complex cloud units in 6G architecture into the state within and between cloud units.Firstly,SM3 algorithm establishes the chain of trust for the system’s trusted boot phase.Then,the remote attestation server(RAS)of distributed cloud units verifies the physical servers.Meanwhile,the physical servers use a ring approach to verify the cloud servers.Eventually,the centralized RAS takes one-time authentication to the critical evidence information of distributed cloud unit servers.Simultaneously,the centralized RAS also verifies the evidence of distributed RAS.We establish our proposed approach in a natural OpenStack-based cloud environment.The simulation results show that the proposed method achieves higher security with less than a 1%system performance loss.

A Review of Lightweight Security and Privacy for Resource-Constrained IoT Devices

The widespread and growing interest in the Internet of Things(IoT)may be attributed to its usefulness in many different fields.Physical settings are probed for data,which is then transferred via linked networks.There are several hurdles to overcome when putting IoT into practice,from managing server infrastructure to coordinating the use of tiny sensors.When it comes to deploying IoT,everyone agrees that security is the biggest issue.This is due to the fact that a large number of IoT devices exist in the physicalworld and thatmany of themhave constrained resources such as electricity,memory,processing power,and square footage.This research intends to analyse resource-constrained IoT devices,including RFID tags,sensors,and smart cards,and the issues involved with protecting them in such restricted circumstances.Using lightweight cryptography,the information sent between these gadgets may be secured.In order to provide a holistic picture,this research evaluates and contrasts well-known algorithms based on their implementation cost,hardware/software efficiency,and attack resistance features.We also emphasised how essential lightweight encryption is for striking a good cost-to-performance-to-security ratio.