An Image Encryption Algorithm by Using Secure Key Generation Techniques

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

To enhance image privacy protection and reduce storage space, this paper proposes an image compression and encryption algorithm that combines compressed sensing, Hachimoji DNA coding, and a 7D hyperchaotic system. The algorithm processes the high-frequency and low-frequency parts after the wavelet transform separately. Sparse high-frequency information is compressed by low-compression measurement. The low-frequency part uses block-compressed sensing, and only a small amount of data is needed to reconstruct a high-quality image. In addition, the measurement matrix is constructed by chaotic sequence, which reduces the demand for memory and transmission bandwidth. To protect compressed data, this paper also presents an image encryption algorithm based on Hachimoji DNA dynamic coding and Joseph dynamic traversal. The algorithm first uses Joseph traversal to disturb the bit position of each pixel dynamically and then implements Hachimoji DNA dynamic coding. At the same time, a new Joseph bidirectional dynamic scrambling-diffusion algorithm is proposed, which gives the encrypted image a uniform grayscale histogram, high information entropy, and sensitivity to resist various attacks effectively.

Cloud computing represents a significant challenge for securing data due to its inherently distributed model. Elliptic Curve Cryptography (ECC) will provide substantial security with smaller key sizes, creating a strong candidate for cloud-based environments. This review critically examines ECC based security architectures in cloud computing with the aim of reducing the cipher space for efficiency and scalability. A comprehensive examination of recent ECC implementations guided this review, including identity-based and lightweight ECC Architectures. Specific consideration was given to cipher space reduction techniques incorporating point compression and optimized scalar multiplication. The review provided evidence of a gap in the literature regarding the ability to counterbalance strength of security with the compactness of the cipher across a range of cloud scenarios and use cases. Most models considered provide little flexibility for real-time or post-quantum alternatives. None of the literature considered cipher space optimization for ECC to date. The ongoing optimization of cipher space is essential to progressing security based on ECC implementations for cloud scenarios. Future research efforts must centre on adaptive, efficient, quantum resilient ECC schemes, in ways that yield high security with minimum impacts on the operational scale, and the associated computational loads.

The use of public-key cryptosystems (PKC) received considerable attention. They are beneficial in encryption as well as signing which play an essential role in electronic banking and financial transactions. Elliptic Curve Cryptography (ECC) is one of best public key techniques because of its small key size and high security. Secure applications in smart cards present implementation challenges particular to the platform's memory, bandwidth, and computation constraints. ECC's unique properties make it especially well suited to smart card applications. ECC systems provide the highest strength per bit of any cryptosystem known today. The paper presents a new method for smart card implementation of elliptic curves, explaining how ECC can not only significantly reduce the cost, but also accelerate the deployment of smart cards in new applications. ECC permits reductions in key and certificate size that translate to smaller memory requirements (especially for EEPROM), which represent significant cost savings. This added functionality can play an effective role in electronic payment and online banking technologies.

Elliptic curve cryptography (ECC) is an excellent candidate for secure embedded multimedia applications due to its small key size and high security protection. The performance profiling of the ECC implementation, such as execution time and data cache stalls, on TriMedia TM1300 and Intel Pentium 4 is conducted in this research. Based on this study, we identify the main bottlenecks of the EEC implementation, and propose some favorable micro-architecture for this application. Moreover, several integer multiplication schemes are presented for the TM1300 processor for performance enhancement. In particular, the FIR-based multiplication is built with the special FIR instruction provided by TM1300. The performance improvement of the proposed schemes is reported and discussed. Overall, we aim at providing a good understanding of the system architecture of secure embedded multimedia applications, hardware and software cryptography implementation with ECC as an example.

The current era has an explosive growth in communications. Many applications like internet banking, personal digital assistants, mobile communication, smart carts need for security in resource-constrained environments. Elliptic curve cryptography (ECC) used as an excellent tool for cryptographic, because of the security and smaller key sizes when compared with other public key algorithms. The efficiency is largely affected by the underlying arithmetic primitives. This paper explores FPGA designs for two of the most important field primitives namely multiplication and inverse. The smallest programmable entity in an FPGA is the lookup table. A novel finite field multiplier based on the recursive Karatsuba algorithm is proposed. This proposed multiplier combines two variants of Karatsuba. The general Karatsuba multiplier has a large gate count but for small sized multiplications is compact because it utilizes LUT resources efficiently. For largely sized multiplications, the simple Karatsuba is efficient as it requires lesser gates. This proposed hybrid multiplier uses a simple algorithm for initial recursion and small-sized final multiplication has been performed using the general algorithm. While comparing with reported literature this multiplier obtains the best area time product.

A novel quantum gray-level image encryption and decryption algorithm based on image correlation decomposition is proposed. The correlation among image pixels is established by utilizing the superposition and measurement principle of quantum states. And a whole quantum image is divided into a series of sub-images. These sub-images are stored into a complete binary tree array constructed previously and then randomly performed by one of the operations of quantum random-phase gate, quantum revolving gate and Hadamard transform. The encrypted image can be obtained by superimposing the resulting sub-images with the superposition principle of quantum states. For the encryption algorithm, the keys are the parameters of random phase gate, rotation angle, binary sequence and orthonormal basis states. The security and the computational complexity of the proposed algorithm are analyzed. The proposed encryption algorithm can resist brute force attack due to its very large key space and has lower computational complexity than its classical counterparts.

This study introduces a cutting-edge image encryption algorithm aimed at elevating security standards. The Pan-Tompkins Algorithm (PTA) for key generation is proposed for the first time in this study. Additionally, employing steganography through the Least Significant Bit (LSB) method for embedding keys within the encrypted image enhances secure key distribution, thereby fortifying the encryption process. On the other hand, the integration of advanced algorithms, such as Zigzag scanning, the Affine Image Encryption Algorithm (AA), and the Vigenere Image Encryption Algorithm (VA), constitutes the fundamental innovation of the proposed image encryption algorithm. The proposed algorithm is named PanAAVA:Affine Algorithm and Vigenere Algorithm Encryption with PTA-Based Key Generation. The PanAAVA algorithm ensures unparalleled security by encrypting the positions and values of pixels using AA and VA. Notably, using PTA for key generation marks a distinctive and new key generation method feature of the algorithm. To assess the effectiveness of the PanAAVA, a comprehensive comparative analysis is conducted against well-established encryption methodologies, including Lena, Baboon, Airplane, and Pepper.The PanAAVA demonstrates exceptional proficiency in histogram analysis. The PanAAVA demonstrates a Unified Average Changing Intensity (UACI) of 33.4044%. Additionally, the Number of Pixels Change Rate (NPCR) is measured at 99.7442%, showcasing the algorithm’s effectiveness in inducing significant pixel changes. The proposed algorithm’s Mean Square Error (MSE) is calculated at 3.20679E5%. The proposed algorithm’s Peak Signal to Noise Ratio (PSNR) is recorded at 9.512475. The Key Space Size of the proposed algorithm is measured at 2209. Regarding correlation analysis, the PanAAVA achieves a high correlation score of 7.9996. The proposed algorithm successfully passes the National Institute of Standards and Technology (NIST) analysis, demonstrating a remarkably strong correlation close to 0 and a Structural Similarity Index Measure (SSIM) of 0.9977. Furthermore, regarding quantum communication, the proposed algorithm maintains stable key rates of 47.5 ± 0.8 kHz during the day and 50.9 ± 0.7 kHz at night. Additionally, PanAAVA achieves low Quantum Bit Error Rate (QBER) values of 4.77 ± 0.02, ensuring reliable and secure communication. The PanAAVA also demonstrates robust asymmetries at 49.81 ± 0.02 and 50.14 ± 0.03 for a crystal length of 20 mm. highlighting PanAAVA’s adaptability and effectiveness in different scenarios. PanAAVA outperforms other encryption algorithms concerning performance measurements and comparisons. In conclusion, the PanAAVA emerges as a beacon of superior security capabilities and innovation in image encryption, showcasing the potential to redefine standards in the field.

Radio‐frequency identification (RFID) technology has proliferated over the last few years and being deployed as identification technology in numerous domains like intelligent transportation systems (ITS) and Internet of Vehicles (IoV) for applications like road safety, efficient traffic management, automatic toll collection, intelligent parking, etc. As RFID devices, as well as the possible domains of ITS and IoV onto which the RFID technology can be deployed, are usually resource‐constrained, thus, security and privacy become a major concern. So, public‐key cryptography becomes the better choice for enhancing the security of RFID based systems. Elliptic curve cryptography (ECC) is one of the dominant and secure asymmetric‐key cryptosystems being used for RFID security due to its smaller key size. Numerous RFID authentication schemes based on ECC have been suggested in literature, however, the majority has various serious security weaknesses. To bridge those existing security weaknesses, an enhanced ECC based light weight protocol for RFID systems has been proposed in this article. An extensive security analysis has been performed to demonstrate various secure features offered by our proposed protocol, and formal security analysis is being conducted using Automated Validation of Internet Security Protocols and Applications tool. The performance of our proposed RFID protocol has been compared with various existing RFID based security solutions on the basis of parameters, that is, computational cost, communication cost, and storage requirement. Simulation results indicate that the proposed lightweight protocol is more secure and performance efficient than the existing RFID protocols, and is well suited for practical applications.

Many researchers have used the properties of the popular Elliptic Curve Cryptography(ECC) to devise a stronger and faster image encryption algorithm to assure the secrecy of images during online transmission. In this paper, a robust Elliptic curve based image encryption and authentication model for both grayscale and color images has been proposed. The model uses the secure Elliptic Curve Diffie-Hellman(ECDH) key exchange to compute a shared session key along with the improved ElGamal encoding scheme. 3D and 4D Arnold Cat maps are used to effectively scramble and transform the values of plain image pixels. A well-structured digital signature is used to verify the authenticity of the encrypted image prior to decryption. The model produces good-quality cipher images with an average entropy of 7.9993 for grayscale and 7.99925 for the individual components of color images. The model has high average NPCR of 99.6%, average UACI of 33.3% and low correlation for both grayscale and color images. The model has low computational costs with minimized point multiplication operations. The proposed model is robust with high resilience against statistical, differential, chosen-plaintext(CPA), known-plaintext(KPA) and occlusion attacks.

Elliptic curves cryptography was introduced independently by Victor Miller (Miller, 1986) and Neal Koblitz (Koblitz, 1987(Koblitz, ) in 1985. .At that time elliptic curve cryptography was not actually seen as a promising cryptographic technique.As time progress and further research and intensive development done especially on the implementation side, elliptic curve cryptography is now being implemented widely.Elliptic curves cryptography offers smaller key size, bandwidth savings and faster in implementations when compared to the RSA (Rivest-Shamir-Adleman) cryptography which based its security on the integer factorization problem.The most interesting feature of the elliptic curves is the group structure of the points generated by the curves, where points on the elliptic curves form a group.The security of elliptic curves cryptography relies on the elliptic curves discrete logarithm problem.The elliptic curve discrete logarithm problem is analogous to the ordinary algebraic discrete logarithm problem, l = g x , where given the l and g, it is infeasible to compute the x.Elliptic curve discrete logarithm problem deals with solving for n the relation P = nG.Given the point P and the point G, then it is very hard to find the integer n.To implement the discrete logarithm problem in elliptic curve cryptography, the main task is to compute the order of group of the curves or in other words the number of points on the curve.Computation to find the number of points on a curve, has given rise to several point counting algorithms.The Schoof and the SEA (Schoof-Elkies-Atkin) point counting algorithms will be part of the discussion in this chapter.This chapter is organized as follows: Section 2, gives some preliminaries on elliptic curves, and in section 3, elliptic curve discrete logarithm problem is discussed.Some relevant issues on elliptic curve cryptography is discussed in section 4, in which the Diffie-Hellman key exchange scheme, ElGamal elliptic curve cryptosystem and elliptic curve digital signature scheme are discussed here accompanied with some examples.Section 5 discussed the two point counting algorithms, Schoof algorithm and the SEA (Schoof-Elkies-Atkin) algorithm.Following the discussion in section 5, section 6 summaries some similarities and the differences between these two algorithms.Section 7 gives some brief literature on these two point counting algorithms.Finally, section 8 is the concluding remarks for this chapter. Elliptic curvesElliptic curves obtained their name from their relation to elliptic integrals that arise from the computation of the arc length of ellipses (Lawrence & Wade, 2006).Elliptic curves are www.intechopen.com Cryptography and Security in Computing1 1 2 3 4 2 2 4 Fig. 1.1. 2(1 ) (1 ) yx x x   www.intechopen.com

Fraud detection in banking is a critical domain for financial security, driven by the rising frequency and sophistication of cyber-attacks. This paper introduces a dual-layered fraud detection framework combining key agreement protocols and face authentication. The system ensures secure communication through cryptographic techniques, such as Diffie-Hellman and Elliptic Curve Cryptography, while leveraging real-time facial recognition powered by TensorFlow and OpenCV for biometric authentication. These technologies collectively address identity theft, unauthorized access, and data breaches in banking operations. Implementation results demonstrate a high accuracy rate in user verification, efficient transaction processing, and robust protection against cyber threats. This paper outlines the system's architecture, implementation, and performance while addressing associated challenges such as privacy concerns, algorithmic biases, and scalability. The findings highlight the transformative potential of integrating cryptography and biometric authentication for modern banking security.

The application of smart cards and its fraudulent manipulation by software, hardware or telecommunication appears to be a major concern. Security breaches of smart cards, hacking into the system and creating duplicates of the cards have to be rectified. In this paper we propose an approach to design a more secure two-level authentication process that uses the PIN number as the first level of authentication and OTP generated using SHA-256 as the second level of authentication. Also comparison of various Hash algorithms are performed to justify the use of SHA-256 for OTP generation.

Lightweight image encryption refers to the use of encryption algorithms designed to secure images while considering the limitations of resources, such as processing power and memory, typically found in devices like IoT devices, mobile phones, and embedded systems. This paper proposes a lightweight image encryption based on an LED encryption algorithm and a method for a pseudo number generator called Rossler attractor. Image is split into their three-color bands (RGB) and then partitioned into a block for encryption, a three-equations model (Rossler Attractor) is used for a pseudo number generator, a specific operation applied for producing key scheduled for rounds in LED to seem as random as possible. The experiment explains the objective test to ensure the performance. The contribution of this work is to present an efficient method for lightweight encryption that is applied to color images with a pseudo number generator-based Rossler attractor dependent on a three-dimensional equation. The technique makes it sensitive to initial conditions and could seem like dynamic encryption that resisted many types of attacks. Visually test represented by the histogram of the image before and after encryption is noted that the result is uniform and differs from the input one. The correlation of the output image is a low value which means no correlation is there between pixels horizontal, vertical and diagonal. The similarity test also applied such as MSE, PSNR and SSIM which also explain no similarity between plain and encrypted images. The randomness of generated numbers was tested using the standard test NIST for evaluation of the input key

The image watermarking technology is a vital facet about multimedia authentication and copyright protection to improve its reliability and security. This paper proposes an embedment of encrypted watermark in a JPEG image to address the issues of proprietorship of digital images. Amongst the cryptographic solutions, the most satisfactory cryptography method is Elliptic Curve Cryptography because of its small usage of bandwidth, low computational time and small key size. DWT and SVD are used as a scientific means to implant watermark in the image. The quality of watermarked image is measured by Peak signal to noise ratio (PSNR) and to compare the recovered watermark and the original watermark Normalized correlation (NC) is used.