Cryptographic Attacks Research Articles

Dynamic feedback bit-level image privacy protection based on chaos and information hiding

Bit is the most basic unit of a digital image in the spatial domain, and bit-level encryption is regarded as an important technical means for digital image privacy protection. To address the vulnerability of image privacy protection to cryptographic attacks, in this paper, a bit-level image privacy protection scheme using Zigzag and chain-diffusion is proposed. The scheme uses a combination of Zigzag interleaving scrambling with chaotic sequences and chain-diffusion method images are encrypted at each bit level, while using non-sequential encryption to achieve efficient and secure encryption. To balance security and efficiency, the encryption strategy for each bit layer is weighted. The chaos-based sequences used for encryption depend on the previous hash value, thus the effect of chain-diffusion is achieved. To further enhance the encryption effect, a non-sequential encryption technique by non-linearly rearranging the bit cipher image is employed, so that the attacker cannot crack the protection scheme by analyzing the encrypted image. The ciphertext image hidden by discrete wavelet transform (DWT) also provides efficient encryption, higher level of security and robustness to attacks. This technology provides indistinguishable secret data embedding, making it difficult for attackers to detect or extract hidden information. Experimental results show that this scheme can effectively protect the confidentiality of the image and can resist various common cryptographic attacks. The scheme proposed in this paper is a preferred digital image privacy protection technology, so it has broad application prospects in image secure transmission occasions.

A review of time-memory trade-off techniques

This paper delves into the discussion of time-memory trade-off techniques in the field of cryptanalysis. The method was initially introduced by Hellman in 1980, subsequently, DP trade-off, rainbow trade-off, and checkpoint trade-off have been proposed to enhance the efficiency of cryptographic attacks. This paper elaborates on the concept of rainbow trade-off and their variants and presents optimizations in terms of storage and runtime speed for time-memory trade--off methods. Ingenious storage optimization significantly reduces the storage overhead of pre-computed tables, and the rapid advancement of implementation platforms achieves speed optimization for the online phase. Through these optimization measures, time-memory trade-off methods exhibit even more remarkable performance in practical applications. For researchers and practitioners in the field of cryptography, the content of this paper provides valuable references and insights for their work.

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.

A lower bound on the third-order nonlinearity of the simplest [formula omitted] bent functions

Boolean functions used in symmetric-key encryption should have high higher-order nonlinearity to resist several known cryptographic attacks, such as algebraic attacks and low-degree approximation attacks. The higher-order nonlinearity also plays an important role in coding theory and theoretical computer science, since it relates to the covering radius of Reed–Muller codes and the Gowers norm, respectively. It is well-known that bent functions have the highest nonlinearity in an even number of variables and thus they possess the best ability to withstand fast correlation attacks and best affine approximation attacks. However, there is currently limited knowledge regarding the higher-order nonlinearity of bent functions because computing the higher-order nonlinearity, or even providing tight lower bounds, is an extremely hard task. In 1974, Dillon proposed two well-known classes of bent functions based on partial spread (in brief, PS), called PS− and PS+, respectively. He also exhibited a subclass of bent functions in PS−, known as partial spread affine plane(PSap for short). In this paper, we provide a lower bound on the third-order nonlinearity of the simplest PSap bent functions in n variables, where n≥6 is even, by calculating the nonlinearities of all second-order derivatives of this kind of bent functions. Compared to the two known lower bounds on the third-order nonlinearity given by Carlet and Tang et al. respectively, our lower bound is much better than these two ones.

Square impossible differential attack and security of AES in known plaintext scenario

In this work, we examine the security of the 8-round AES, under the known plaintext attack scenario, a type of cryptographic attack in which an attacker has access to the plaintext and corresponding ciphertext pairs. We present an innovative impossible differential (ID) attack technique, which utilizes a specific ID characteristic, to perform the first known plaintext attack on the 8-round AES with a 256-bit key. Additionally, we propose a new attack methodology, known as the Square Impossible Differential (SID) attack, to enhance the effectiveness of the ID attacks on AES in chosen ciphertext or plaintext scenarios. The SID attack is a combination of a square attack and an ID attack. Our methodology introduces various new approaches, including the key indicator vectors, eliminating the key candidate through the Meet-in-The-Middle technique and mounting the guess and determine attack through the hash tables for the two-round decryption of one column of AES while determining the subkeys constituting the impossible differential characteristic for a given plaintext/ciphertext difference pair. Our approach demonstrates lower computational complexity compared to previous methods, and our analysis shows that the complexities of our known plaintext attack and SID attack are estimated to be 2220 and 2209, respectively.

Experimental Integration of Quantum Key Distribution and Post‐Quantum Cryptography in a Hybrid Quantum‐Safe Cryptosystem

AbstractQuantum key distribution (QKD) and post‐quantum cryptography (PQC) are the two counter measures against cryptographic attacks via quantum computing. While QKD offers information theoretic security but limited authentication scalability, PQC facilitates scalable authentication in high density networks but is not information theoretic secure. Therefore, an ideal quantum‐safe framework should efficiently leverage the complementarity of both techniques. However, despite growing efforts in integrating both, current realizations have focused on channel authentication, and a complete cryptosystem addressing both hybrid authentication and hybrid key exchange is yet to be demonstrated. Here, an authenticated hybrid key exchange protocol is introduced that incorporates PQC and QKD in a modular and information‐theoretic secure architecture. The quantum‐safe protocol is inherently resilient to catastrophic cryptographic failures and provides both forward and post‐compromise security. As proof‐of‐concept implementation, the cryptosystem on a QKD hardware prototype is integrated, with the QKD processing, PQC key exchange and secret state masking via physical unclonable functions (PUFs) all running on a single field programmable gate array (FPGA). This work paves the way for the deployment of versatile and modular quantum‐safe networks that exploit the complementarity of PQC and QKD.

Nonce generation techniques in Schnorr multi-signatures: Exploring EdDSA-inspired approaches

<abstract> <p>This paper proposes a deterministic nonce generation technique to address the catastrophic issues associated with nonce reuse in message signing and to enhance the efficiency of Schnorr multi-signature schemes. Additionally, this research aims to reduce computational complexity and bandwidth requirements in digital and multi-signature schemes while maintaining robust security against common attacks. The proposed method was inspired by the EdDSA approach. The methodology includes a comprehensive mathematical analysis of digital signature algorithms and a rigorous examination of their vulnerabilities to well-known cryptographic attacks. This analysis evaluates the effectiveness and robustness of the proposed nonce generation technique within the frameworks of the Schnorr digital signature and the two-round MuSig schemes. Techniques and tools employed in this research involve deterministically generating nonces by hashing the private key and subsequently hashing the result with the message. Furthermore, it is proposed to exclude the public nonce R from the challenge calculations and to allow signers to directly prove possession of their secret keys through the aggregated public key, thereby eliminating the need for non-interactive zero-knowledge (NIZK) proofs. The findings demonstrate significant reductions in computational complexity and operational requirements, thereby improving bandwidth efficiency and making this method well-suited for resource-constrained devices. The approach also exhibits strong resistance to various attacks, including nonce reuse, key cancellation, rogue keys, and virtual machine rewinding.</p> </abstract>

Novel approaches to biometric security using enhanced session keys and elliptic curve cryptography

Biometric systems have taken the front seat as having core foundations in 21stcentury digital information technology, biometric systems hold a position therein or authentication processes. But the growing complexity of cyber threats requires greater security practices. This paper presents an innovative biometric security approach based on the combination of ECC and more advanced session keys. The goal is to strengthen biometric systems against sophisticated cyber threats ensuring fast and effective authentication methods. The proposed approach takes advantage of ECC’s strength in generating secure biometric data along with session keys dynamically to build a more resilient, yet flexible, security model. It is shown on the simulations that security metrics increase significantly in terms of resistance to common cryptographic attacks and data breaches without decreasing the system performance. This study describes not only the current vulnerabilities in biometric security systems towards more secure and reliable authentication systems by the convergence of biometric data to advanced cryptographic techniques.

Securing air defense visual information with hyperchaotic Folded Towel Map-Based encryption

<p>In modern air defense systems, safeguarding sensitive information is crucial to prevent unauthorized access and cyber-attacks. Here, we present an innovative image encryption approach, leveraging chaotic logistic maps and hyperchaotic Folded Towel Map sequence generation. The proposed image encryption is a multi-layered procedure intended to secure image transmission. It initiates with permutation, where a chaotic logistic map generates pseudo-random sequences to scramble pixel positions. Next, key mixing creates complexity, randomness, and nonlinearity using an invertible key matrix. Finally, the diffusion phase employs hyperchaotic maps to produce a new sequence XORed with the pixels through a bitwise operation, further encrypting the image. This three-stage process efficiently protects images from unauthorized access, ensuring secure transmission. The proposed method enhances security by leveraging non-linearity, sensitivity, and robust mixing, properties making it highly resistant to cryptographic attacks. The experimental results showed robust encryption performance as established by metrics such as an entropy value of 7.9991, a UACI of 33.21%, and an NPCR of 99.61%. The proposed encryption approach outperformed existing methods in securing image transmission and storage, offering a reliable solution for protecting air defense communication strategic data.</p>

Securing wireless sensor networks with novel hybrid lightweight cryptographic protocols

WSN are essential in the Internet of Things (IoT) framework as they enable the gathering and transmission of data in different fields. The limited resources of sensor nodes in these networks require security protocols that are lightweight, striking a balance between data protection and efficiency. This research paper introduces a new hybrid cryptographic protocol called AES-128-CCM + Diffie-Hellman (ACDH), which aims to tackle the security issues encountered by WSN. Here present thorough assessment of the ACDH protocol, with a specific emphasis on critical factors including Security Strength, Energy Efficiency and Communication Overhead. The comparative study examines the ACDH protocol in relation to three well-established lightweight cryptographic protocols like Lightweight IPSec, BLAKE2, and Simon. We analyze and highlight the differences between these protocols. These protocols function as standards for evaluating the efficiency of ACDH in a practical WSN setting. The evaluation unequivocally showcases the supremacy of the proposed ACDH model across various crucial aspects. ACDH demonstrates exceptional Security Strength, guaranteeing strong resilience against established cryptographic attacks and providing a high degree of data safeguarding. It demonstrates exceptional Energy Efficiency, enabling sensor nodes to preserve energy resources while upholding a high standard of security ACDH reduces Resource Utilization, optimizing the utilization of memory and processing power. The protocol’s Communication Overhead is significantly minimal, guaranteeing the most efficient utilization of restricted bandwidth. The ACDH hybrid model consistently surpasses its counterparts in performance, making it the optimal selection for securing WSNs while adhering to the resource limitations of sensor nodes. The results of our research highlight the capability of ACDH as an innovative solution for developing lightweight cryptographic protocols that can improve the security and efficiency of Wireless Sensor Networks in the growing IoT environment.

New Generated Keys of the AES Algorithm Based on the SHA256 Algorithm for Image Encryption

To prevent unauthorized access to digital data, stronger encryption solutions are needed. The Advanced Encryption Standard is instrumental to cryptographic security, but this reliance on traditional forms of key generation risks undoing its potency. In order to fulfill this effect that the research presents its new work for another version of AES key generation with SHA256. Using the high entropy of SHA256, we generate even more complicated and unpredictable keys that drastically raises resilience to cryptographic attacks. We demonstrate this with a Python implementation of our proposed method along with experiments on image data which show significantly increased encryption strength over standard AES, whilst having similar performance. This research represents an additional step toward developing safer methods of encryption that safeguard data.

COMPARATIVE STUDY OF CHAOTIC SYSTEM FOR ENCRYPTION

Chaotic systems leverage their inherent complexity and unpredictability to generate cryptographic keys, enhancing the security of encryption algorithms. This paper presents a comparative study of 13 chaotic keymaps. Several evaluation metrics, including keyspace size, dimensions, entropy, statistical properties, sensitivity to initial conditions, security level, practical implementation, and adaptability to cloud computing, are utilized to compare the keymaps. Keymaps such as Logistic, Lorenz, and Henon demonstrate robustness and high-security levels, offering large key space sizes and resistance to attacks. Their efficient implementation in a cloud computing environment further validates their suitability for real-world encryption scenarios. The context of the study focuses on the role of the key in encryption and provides a brief specification of each map to assess the effectiveness, security, and suitability of the popular chaotic keymaps for encryption applications. The study also discusses the security assessment of resistance to the popular cryptographic attacks: brute force, known plaintext, chosen plaintext, and side channel. The findings of this comparison reveal the Lorenz Map is the best for the cloud environment based on a specific scenario.

Asymmetric multi-image wavelength multiplexing cryptosystem using QZ algorithm and unequal modulus decomposition

An asymmetric multi-image cryptosystem based on wavelength multiplexing is proposed in this paper. Multi-image characteristic of the encryption process has been realized by the QZ synthesis process. Unequal modulus decomposition is used to make the scheme robust to any basic cryptographic attacks. The encryption process has a complex setup that involves phase retrieval algorithms but the decryption is quite simple and fast and can be realized on the hybrid system. Although the scheme is validated on grayscale multi-images, it can also process color images. Cryptosystem is exposed to statistical attacks, noise attacks, and data loss attacks, apart from basic cryptographic attacks. Simulation established the fortitude of the cryptosystem to these attacks. We also analyzed the key space and key sensitivity, and the results show that the cryptosystem has a large key space to resist any brute-force attack. Comparative analysis with similar schemes on multi-image reveals that the cryptosystem has several merits and it is secure against basic and special attacks.

Key dependent information confidentiality scheme based on deoxyribonucleic acid (DNA) and circular shifting

In this era of advanced information technology, the exploration and development of novel mechanisms to ensure information confidentiality have consistently captivated the attention of upcoming researchers. In this article, we present a pioneering approach that combines DNA sequencing with a four-dimensional (4D) hyperchaotic map to bolster the security of digital information. Our primary focus is on the design of a robust and secure scheme for encrypting color images, leveraging DNA cryptography and hyperchaos. By extracting three distinct DNA sequences, we generate encryption keys through the integration of DNA computing and 4D hyperchaotic maps. Notably, these keys are intricately linked to the plaintext and vary with any alterations in the input. Consequently, the proposed encryption method stands resilient against an array of potential cryptographic attacks. To gauge the algorithm's security, we subject it to rigorous standard statistical analysis. Our findings underscore the efficiency and robustness of the proposed framework, establishing its potential for facilitating secure communication.

Exploring the future application of UAVs: Face image privacy protection scheme based on chaos and DNA cryptography

In the application and promotion of UAV in the future, remote sensing image information is transmitted frequently, and its security issues will not be ignored. Aiming at the privacy security problem of portrait information in remote sensing images, this paper proposes a face privacy protection technology scheme based on chaos and DNA cryptography. Firstly, the edge recognition face detection technology is used to identify the face information, and the corresponding matrix is selected as the object of selective encryption. Then, the hash eigenvalues of the selected encrypted object are extracted, and the plaintext-associated chaotic sequences are generated for RGB permutation and zigzag interleaved scrambling in turn. Then, the three channels of RGB are encrypted by dynamic chain DNA encoding in turn. Finally, the cipher-image is obtained after performing discontinuous diffusion and lightweight bit-level confusion. In this paper, chaotic pseudo-random sequences with plaintext correlation and dynamic DNA chain encryption are used to effectively improve the ability of encryption system to resist cryptographic attacks. At the same time, selective encryption can effectively reduce the encryption complexity and performance overhead. Experimental results and security analysis show that the privacy protection scheme has excellent security and efficiency performance. Therefore, the face privacy protection technology scheme reported in this paper has excellent performance and has broad application prospects in UAV and remote sensing communication.

Secure image encryption algorithm using chaos-based block permutation and weighted bit planes chain diffusion

Aiming at the problem of insufficient security of image encryption technology, a secure image encryption algorithm using chaos-based block permutation and weighted bit planes chain diffusion is proposed, which is based on a variant structure of classical permutation-diffusion. During the permutation phase, the encryption operations of dividing an image into sub-block, block scrambling, block rotation and block inversion, negative-positive transformation, color component shuffling are performed sequentially with chaotic sequences of plaintext association. In the chain diffusion stage, different encryption strategies are adopted for the high and low 4-bit planes according to the weight of image information. Theoretical analyses and empirical results substantiate that the algorithm conforms to the cryptographic requirements of confusion, diffusion, and avalanche effects, while possessing excellent numerical statistical properties with a large cryptographic space. Therefore, the cryptanalysis-propelled security enhancement mechanism proposed in this paper effectively amplifies the aptitude of the algorithm to withstand cryptographic attacks.

A new method of image encryption using advanced encryption Standard (AES) for network security

With the rapid increase in the use of technology, images have become a major source of sharing personal, confidential and official information and there is a dire need to protect this secret data. Image encryption plays major role in the security of images and there are many techniques developed for this purpose. Chaos based image encryption has now become most applicable and beneficial technique for image encryption. The purpose of this paper is to highlight a new method of image encryption with the use of advanced encryption standard (AES) and chaotic maps. This technique is composed of substitution and permutation phases. AES is found to be most secure cipher until now against different kinds of attacks. The round keys are generated by AES using key expansion algorithm. The sensitivity of this technique is that it is dependent on initial values and input image. S-boxes in AES introduce non-linearity, confusion, and an avalanche effect, enhancing security and resistance to cryptographic attacks by substituting bytes in the encryption process. The combination of AES and chaotic maps in encryption schemes provides a two-tiered approach to enhance security. AES offers a strong and well-established encryption method, while chaotic maps introduce randomness and complexity, making it more difficult for attackers to decipher encrypted data. This combination is often used to achieve a higher level of encryption security in various applications, including data transmission and storage. Different kinds of analysis and tests are performed on the technique which includes information entropy, number of pixel change rate (NPCR), and peak signal-to-noise ratio (PSNR), unified average changing intensity (UACI) and histogram correlation of adjacent pixels. The results of these tests show that this technique is secure and resistant towards attacks.

A probably secure biometric‐based authentication and key agreement scheme for Internet of Drones

AbstractThe Internet of Drones (IoD) is one of the world's most recent and innovative technology. Drones are most prominent IoT (Internet of Things) gadgets and their applications span from commercial to domestic. The sensitive data stored in drones has increased the demand for the security of communication in the IoD. As a result, numerous authentication and key agreement techniques have been developed to proffers secure communication among the entities of the IoD network. However, after scrutinizing the security of these protocols, many IoD protocols were observed to be susceptible to different cryptographic attacks. This has enhanced the necessity for an improved and efficient authentication scheme in IoD. In this article, we first investigate Zhang et al.'s approach and demonstrate that although it offers security verification, it has certain design problems. It is, furthermore, shown to be vulnerable to privileged insider, offline password guessing, and stolen smart device attacks. Second, we propose a novel biometric‐based scheme that includes countermeasures to protect against these flaws. The security of the mechanism is examined under real or random oracle model, informal security analysis and scyther simulation for numerous cryptographic assaults. Also, the performance analysis substantiates the competency of the proposed scheme corresponding to computation and communication cost with existing schemes.

A robust VVC video encryption scheme based on the dynamical chaotification model

With the considerable surge of video assets, the demand for video content security has undergone substantial growth. Since the advent of H.264/AVC and H.265/HEVC, selective encryption algorithms (SEAs) have become a focus. However, there is little research based on the H.266/VVC. To fill the gap, a VVC encryption scheme is proposed in this paper. Considering that most existing SEAs are easily cracked under cryptographic attacks, a dynamical chaotification model (DCM) is designed to resist chosen-plaintext attack (CPA). Additionally, given that a majority of existing SEAs are incapable of decrypting correctly in the case of packet loss, each slice is encrypted independently to enhance robustness. Firstly, the three-dimensional (3D) DCM is designed based on the exponential feedback and the boundary function. Secondly, the dynamical parameter in the 3D-DCM is updated by the encoding parameters in the VVC encoder. Then the initial values and other model parameters of the 3D-DCM are scrambled by the hash values of the slice headers (SHs). Finally, the texture, motion, and structure information of VVC videos are encrypted using the iterative output of the 3D-DCM. In particular, three exclusive elements in H.266/VVC are selected in the RSES, including matrix-based intra prediction (MIP), cross-component linear model prediction (CCLM), and multiple transform selection (MTS). Experimental results demonstrate the outstanding performance of the proposed RSES in robustness and resistance to CPA, while gratifying bit rate and real-time requirements. Therefore, it is a promising encryption scheme in cryptographic applications.

Cryptanalysis of an image encryption algorithm using quantum chaotic map and DNA coding

Recently, an image encryption algorithm using Quantum Chaotic Map and DNA Coding (QCMDC-IEA) has been reported. It consists of two main components: pixel-level permutation and DNA domain substitution. To support its ability to withstand various attacks, several security analyses and experimental simulations were presented. However, after careful cryptanalysis, we found that QCMDC-IEA has inherent fatal security problems. Although formally using complex chaos and DNA encoding, the chaos-based sequences used for encryption in QCMDC-IEA are independent of a plain image such that it suffers from the defect of the existence of an equivalent key. Moreover, the lack of confusion and diffusion in DNA domain encryption makes it vulnerable to cryptographic attacks. DNA domain encryption is then essentially a 2-bit data substitution process, so it can be equivalently simplified. On this basis, we propose an attack method to crack QCMDC-IEA, which first obtains an equivalent permutation key by differential cryptanalysis, and then eliminates the DNA domain substitution based on a chosen-plaintext attack using only four special plain images and their corresponding cipher images, and finally recovers the original plain images. Our attack method takes full advantage of the security defects in QCMDC-IEA and achieves complete decipherment with low complexity, thus better revealing its intrinsic security mechanism. To improve the security performance, some security enhancement suggestions are recommended for similar cryptosystems. Both theoretical analysis and experimental simulation results show that the proposed cryptographic attack method is effective and feasible for QCMDC-IEA with low attack complexity. Therefore, the cryptanalysis work in this paper can provide some theoretical hints for improving the security of a class of image encryption algorithms based on DNA coding and chaos.