Key Block Cipher Research Articles

An Optimal Modified Bidirectional Generative Adversarial Network for Security Authentication in Cloud Environment

In the contemporary world, mobile appliances are connected to a cloud environment for balancing the wide range of data that is created. Because of the shortage of security and authentication, Cloud Computing (CC) is vulnerable to many attacks and security risks in the communication environment. Therefore, security is more significant for secure data transmission. In this paper, we proposed the modified Bidirectional Generative Adversarial Networks based on the Artificial Hummingbird (AH) algorithm (modified BiGAN-AH approach) within the cloud environment for security authentication. The ML-based BiGAN classifier is utilized to identify attacks during the session set-up stage. To reduce the loss, the cross-entropy function is computed in the training stage of BiGAN for estimating divergence. The discriminator’s parameters are predetermined while training both the encoder and generator. For enhancing encryption difficulty, the integration of the Substitution Permutation (SP) network and Feistel combination are used in the Symmetric Key Block Cipher (SKBC) algorithm. Data security is provided by the SKBC. To enhance the efficiency of GAN in detecting attacks, the Artificial Hummingbird (AH) algorithm is utilized for optimizing hyperparameters. The experimental outcomes reveal that the proposed approach reached 93.75% accuracy, 92.41% precision, 93.85% recall value, and a 93.52% F1 score.

Image encryption using enhanced DCT transform for frequency domain applications

improving system performance and reliability. Key leaks and inadequate key strength are common issues with numerical global key models and public block cipher algorithms that use pseudo-random numbers. Additionally, because of the spatial correlation between neighboring pixel values, no current crypto scheme is appropriate for picture encryption. An intellectual domain-based image cryptosystem with hierarchical modification structures is proposed to overcome all these obstacles. The suggested framework also aims to maximize confusion metrics and improve security efficiency. In this paper modified DCT transform domain based frequency domain image encryption is proposed along with optimized pixel grouping based cipher key formulation with reduced complexity overhead. The proposed image encryption model can achieve 100 percentage transformations irrespective to the image non-linear characteristics and associated spatial dimensions. To validate the performance metrics of proposed image encryption different biomedical images collected and the superiority of proposed system is verified using quantitative and qualitative analyzes. The proposed implementation helps in offering privacy in crypto system based network security. It also validated that this hybrid combination also extend the applicability of crypto system for EMR applications.

A type of public - key block cipher algorithm

The paper proposes a type of block cipher algorithm based on cryptographic hash function and public key cryptography. The algorithm proposed here is capable of verifying the origin and integrity of the encrypted message. On the other hand, establishing a shared secret key between the sender/encryptor and the receiver/decryptor can be done for each message separately.

A method for constructing public - key block cipher schemes based on discrete logarithm problem

The paper proposes a method for constructing block cipher schemes that enables verifying the source and integrity of the encrypted message. Additionally, the shared secret key between the sender/encryptor and the receiver/decryptor for each encrypted message is established based on the mechanism of public key cryptography.

Quantum data communication protection with the quantum permutation pad block cipher in counter mode and Clifford operators

Background: This article integrates two cryptographic schemes for quantum data protection. The result achieves authentification, confidentiality, integrity, and replay protection. The authentication, integrity, and replay aspects leverage quantum Clifford operators. Confidentiality of quantum messages is achieved using the quantum permutation pad (QPP) cryptographic scheme. Methods: Clifford operators and the QPP are combined into a block cipher in counter mode. A shared secret is used to seed a random number generator for the arbitrary selection of Clifford operators and quantum permutations to produce a signature field and perform encryption. An encryption and signature algorithm and a decryption and authentication algorithm are specified to protect quantum messages. Results: A symmetric key block cipher with authentication is described. The plain text is signed with a sequence of randomly selected Clifford operators. The signed plaintext is encrypted with a sequence of randomly selected permutations. The algorithms are analyzed. As a function of the values selected for the security parameters, there is an unavoidable risk of collision. The probability of block collision is modelled versus the number of blocks encrypted, for block sizes two, three, four, and five qubits. Conclusions: The scheme is practical but does not achieve perfect indistinguishability because of the risk of message collision. This is normal and unavoidable when fixed-size fields are assumed to make a scheme practical. The model can be used to determine the values of the security parameters and the lifetime of session keys to mitigate the risk of information leakage according to the needs of the scheme’s users. The session key can be renewed when a tolerable maximum number of messages has been sent.

Sparse Compression-Based Image Encryption using Data Encryption Standards RC5

In this work, we have used the standard symmetric key block cipher data encryption algorithm RC5(32,16,8) for the encryption of digital greyscale images. For this, we have only considered the nonzero elements of the sparse matrix of the images which have been generated using the sparse representation technique. The security strength of the proposed technique is verified through different quality parameters, e.g. information entropy, correlation coefficients, NPCR, UACI, and NIST test. Our proposed algorithm achieved the maximum information entropy value of 7.9977 for the cameraman image and nearly zero correlation coefficient values establish the robustness of the cryptosystem. The highest NPCR and UACI values obtained in our work are 99.6916 and 33.9605, which are closer to the maximum theoretical values. The proposed technique is also compared with some of the contemporary works to validate the credibility of our proposed algorithm.

Enhancing Security in ZigBee Wireless Sensor Networks: A New Approach and Mutual Authentication Scheme for D2D Communication.

The latest version of ZigBee offers improvements in various aspects, including its low power consumption, flexibility, and cost-effective deployment. However, the challenges persist, as the upgraded protocol continues to suffer from a wide range of security weaknesses. Constrained wireless sensor network devices cannot use standard security protocols such as asymmetric cryptography mechanisms, which are resource-intensive and unsuitable for wireless sensor networks. ZigBee uses the Advanced Encryption Standard (AES), which is the best recommended symmetric key block cipher for securing data of sensitive networks and applications. However, AES is expected to be vulnerable to some attacks in the near future. Moreover, symmetric cryptosystems have key management and authentication issues. To address these concerns in wireless sensor networks, particularly in ZigBee communications, in this paper, we propose a mutual authentication scheme that can dynamically update the secret key value of device-to-trust center (D2TC) and device-to-device (D2D) communications. In addition, the suggested solution improves the cryptographic strength of ZigBee communications by improving the encryption process of a regular AES without the need for asymmetric cryptography. To achieve that, we use a secure one-way hash function operation when D2TC and D2D mutually authenticate each other, along with bitwise exclusive OR operations to enhance cryptography. Once authentication is accomplished, the ZigBee-based participants can mutually agree upon a shared session key and exchange a secure value. This secure value is then integrated with the sensed data from the devices and utilized as input for regular AES encryption. By adopting this technique, the encrypted data gains robust protection against potential cryptanalysis attacks. Finally, a comparative analysis is conducted to illustrate how the proposed scheme effectively maintains efficiency in comparison to eight competitive schemes. This analysis evaluates the scheme's performance across various factors, including security features, communication, and computational cost.

GCM-SIV1.5: Optimal Tradeoff between GCM-SIV1 and GCM-SIV2.

GCM-SIV2 is a nonce-based beyond-birthday-bound (BBB)-secure authenticated encryption (AE) mode introduced by Iwata and Minematsu at FSE 2017. However, it is built by combining two instances of GCM-SIV1 and needs eight keys, which increases the costs of hardware and software implementation. This paper aims to reduce these costs by optimizing components (such as key materials, hash calls, and block cipher calls) and proposes an optimal tradeoff between GCM-SIV1 and GCM-SIV2 called GCM-SIV1.5. Moreover, we introduce the faulty nonce setting to AE and prove the BBB security of GCM-SIV1.5 with graceful security degradation in the faulty nonce setting by mirror theory. Finally, we discuss advantages of GCM-SIV1.5.

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.

Adaptive Multi-Applications Cryptographic System

Cryptography is the core method utilized to protect the communications between different applications, terminals, and agents distributed worldwide and connected via the internet. Yet, with the distribution of the low-energy and low-storage devices, in the Internet-of-Things (IoT), the cryptography protocols cannot be implemented because of the power constraints or because the implementation is beyond the time constraints that hindered their usability of these protocols in real-time critical applications. To solve this problem, an Adaptive Multi-Application Cryptography System is proposed in this paper. The proposed system consists of the requirements identifier and the implementer, implemented on the application and transportation layer. The requirement identifier examines the header of the data, determines the underlying application and its type. The requirements are then identified and encoded according to four options: high, moderate, low, and no security requirements. The inputs are processed, and ciphertext is produced based on the identified requirements and the suitable cryptography algorithm. The results showed that the proposed system reduces the delay by 97% relative to the utilized algorithms' upper-bound delay. Keywords: Cryptography, symmetric key encryption, block cipher, delay and performance, quantum computing.

Hardware Context Switch-based Cryptographic Accelerator for Handling Multiple Streams

The confidentiality and integrity of a stream has become one of the biggest issues in telecommunication. The best available algorithm handling the confidentiality of a data stream is the symmetric key block cipher combined with a chaining mode of operation such as cipher block chaining (CBC) or counter mode (CTR). This scheme is difficult to accelerate using hardware when multiple streams coexist. This is caused by the computation time requirement and mainly by management of the streams. In most accelerators, computation is treated at the block-level rather than as a stream, making the management of multiple streams complex. This article presents a solution combining CBC and CTR modes of operation with a hardware context switching. The hardware context switching allows the accelerator to treat the data as a stream. Each stream can have different parameters: key, initialization value, state of counter. Stream switching was managed by the hardware context switching mechanism. A high-level synthesis tool was used to generate the context switching circuit. The scheme was tested on three cryptographic algorithms: AES, DES, and BC3. The hardware context switching allowed the software to manage multiple streams easily, efficiently, and rapidly. The software was freed of the task of managing the stream state. Compared to the original algorithm, about 18%–38% additional logic elements were required to implement the CBC or CTR mode and the additional circuits to support context switching. Using this method, the performance overhead when treating multiple streams was low, and the performance was comparable to that of existing hardware accelerators not supporting multiple streams.

Efficient Implementation of PRESENT and GIFT on Quantum Computers

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

A Secure IoT System Using Quantum Cryptography with Block Cipher

ABSTRACT In our days Iot technology used in a wide aspect of life and became an important topic for researchers in the scope of the technologies. Although all these benefits it needs more security and stays have security intimidation, such as data breaking or channel attacks via eavesdroppers and viruses, especially when the people used IoT for long distance for example for city or country, etc. or even using IoT to transfer secret information about things in big offices, for this reasons needed to use a method which increases IoT security and protection our special data. In this paper, we will use the internet of things IoT with quantum key distribution (QKD) and block cipher RC6 algorithm, where QKD is the science and art of using the quantum mechanical effect to perform cryptographic tasks and generates a secret key. Also, we need to overcome the loss of information which occurs because the information transition effected by noise or outside operators when using quantum cryptography, so the optimal solution is using the quantum bit error rate (QBER) to produce a more safe way for quantum communication among things in IoT techniques. QBER is done by using servers to correct error after sending a key for decryption method by another server to decrypt information using RC6 block cipher algorithm, during creating a secret key we need to calculate quantum correct probability and compare the result with threshold suggested and agreed by the servers.

Color Image Encryption using AES and RSA

Information security is an important task on multimedia and communication world. During storing and sharing maintaining a strategic distance from the outsider access of information is the difficult one. There are many encryption algorithms that can provide data security. In this paper two of the encryption algorithms namely AES and RSA are implemented for color images. AES (Advanced Encryption Standard) is a symmetric key block cipher published in December 2001 by NSIT (National Institute of Standards and Technology). RSA (Rivest-Shamir-Adleman) is an asymmetric key block cipher. It uses two separate keys, one for encryption called the public key and other for decryption called the private key. Both the implementation and analysis are done in Matlab. The quality and security level of both the algorithms is analysed based on various criteria such as Histogram analysis, Correlation analysis, Entropy analysis, NPCR (Number of Pixel Change Rate), UACI (Unified Average Changing Intensity), PSNR (Peak Signal-to-Noise Ratio).

A Novel Privacy Approach of Digital Aerial Images Based on Mersenne Twister Method with DNA Genetic Encoding and Chaos

Aerial photography involves capturing images from aircraft and other flying objects, including Unmanned Aerial Vehicles (UAV). Aerial images are used in many fields and can contain sensitive information that requires secure processing. We proposed an innovative new cryptosystem for the processing of aerial images utilizing a chaos-based private key block cipher method so that the images are secure even on untrusted cloud servers. The proposed cryptosystem is based on a hybrid technique combining the Mersenne Twister (MT), Deoxyribonucleic Acid (DNA), and Chaotic Dynamical Rossler System (MT-DNA-Chaos) methods. The combination of MT with the four nucleotides and chaos sequencing creates an enhanced level of security for the proposed algorithm. The system is tested at three separate phases. The combined effects of the three levels improve the overall efficiency of the randomness of data. The proposed method is computationally agile, and offered more security than existing cryptosystems. To assess, this new system is examined against different statistical tests such as adjacent pixels correlation analysis, histogram consistency analyses and its variance, visual strength analysis, information randomness and uncertainty analysis, pixel inconsistency analysis, pixels similitude analyses, average difference, and maximum difference. These tests confirmed its validity for real-time communication purposes.

Paradigm Shifts in Cryptographic Engineering

The papers in this special section identify paradigm shifts in cryptographic engineering. Modern cryptography is almost five decades old, and we have seen some interesting breakthroughs throughout its relatively young history. These include the engineering foundations of symmetric key cryptography and block ciphers in particular (like the DES and the AES), the discovery of public-key cryptography, protocols for secure computations for general and specific tasks using interactions among parties and tools like homomorphic encryption (this line of work has been enhancing the use of cryptography beyond secure messaging into secure computing).

Statistical Analysis and Security Evaluation of Chaotic RC5-CBC Symmetric Key Block Cipher Algorithm

In some previous research works, it has been theoretically proven that RC5-CBC encryption algorithm behaves as a Devaney topological chaos dynamical system. This unpre-dictable behavior has been experimentally illustrated through such sensitivity tests analyses encompassing the avalanche effect phenomenon evaluation. In this paper, which is an extension of our previous work, we aim to prove that RC5 algorithm can guarantee a much better level of security and randomness while behaving chaotically, namely when embedded with CBC mode of encryption. To do this, we have began by evaluating the quality of such images encrypted under chaotic RC5-CBC symmetric key encryption algorithm. Then, we have presented the synthesis results of an hardware architecture that implements this chaotic algorithm in FPGA circuits.

Efficient Detection for Malicious and Random Errors in Additive Encrypted Computation

Although data confidentiality is the primary security objective in additive encrypted computation applications, such as the aggregation of encrypted votes in electronic elections, ensuring the trustworthiness of data is equally important. And yet, integrity protections are generally orthogonal to additive homomorphic encryption, which enables efficient encrypted computation, due to the inherent malleability of homomorphic ciphertexts. Since additive homomorphic schemes are founded on modular arithmetic, our framework extends residue numbering to support fast modular reductions and homomorphic syndromes for detecting random errors inside homomorphic ALUs and data memories. In addition, our methodology detects malicious modifications of memory data, using keyed syndromes and block cipher-based integrity trees, which allow preserving the homomorphism of ALU operations, while enforcing non-malleability of memory data. Compared to traditional memory integrity protections, our tree-based syndrome generation and updating is parallelizable for increased efficiency, while requiring a small Trusted Computing Base for secret key storage and block cipher operations. Our evaluation shows more than 99.999 percent detection rate for random ALUs errors, as well as 100 percent detection rate of single bit-flips and clustered multiple bit upsets, for a runtime overhead between 1.2 and 5.5 percent, and a small area penalty.

An Effective Lightweight Cryptographic Algorithm to Secure Resource-Constrained Devices

In recent years, small computing devices like embedded devices, wireless sensors, RFID tags (Radio Frequency Identification), Internet of Things (IoT) devices are increasing rapidly. They are expected to generate massive amount of sensitive data for controlling and monitoring purposes. But their resources and capabilities are limited. Those also work with valuable private data thus making security of those devices of paramount importance. Therefore, a secure encryption algorithm should be there to protect those vulnerable devices. Conventional encryption ciphers like RSA or AES are computationally expensive; require large memory but hinder performances of those devices. Simple encryption techniques, on the other hand are easy to crack, compromising security. In this paper a secure and efficient lightweight cryptographic algorithm for small computing devices has been proposed. It is a symmetric key block cipher, employing custom substitution-permutation (SP) network and a modified Feistel architecture. Two basic concepts from Genetic algorithm are used. A Linux based benchmark tool, FELICS is used for the measurement and MATLAB for the purpose of encryption quality testing. An improvement over the existing algorithm, the proposed algorithm reduces the use of processing cycles but at the same time provides sufficient security.

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.