scholarly journals Dynamic fractional chaotic biometric isomorphic elliptic curve for partial image encryption

2021 ◽  
pp. 18-18
Author(s):  
Ahmed Kamal ◽  
Esam Hagras ◽  
H.A. El-Kamchochi
Keyword(s):  
Elliptic Curve ◽  
Image Encryption ◽  
High Speed ◽  
Chaotic Behavior ◽  
Key Exchange ◽  
Discrete Wavelet ◽  
Security Level ◽  
Differential Analysis ◽  
Digital Identity ◽  
Secret Key

In this paper, a Modular Fractional Chaotic Sine Map (MFC-SM) has been introduced to achieve high Lyapunov exponent values and completely chaotic behavior of the bifurcation diagram for high level security. The proposed MFC-SM is compared with the conventional non MFC-SM and it has an excellent chaotic analysis. In addition, the randomness test results indicate that the proposed MFC-SM shows better performance and satisfy all randomness tests. Due to the excellent chaotic properties and good randomization results for the proposed MFC-SM, it is used to be cooperated with the biometric digital identity to achieve dynamic chaotic biometric digital identity. Also, for real time image encryption, both Discrete Wavelet Transform (DWT) partial image encryption and Isomorphic Elliptic Curve (IEC) key exchange are used. In addition, the biometric digital identity is extracted from the user fingerprint image as fingerprint minutia data incorporated with the proposed MFC-SM and hence, a new Dynamic Fractional Chaotic Biometric Digital Identity IEC (DFC-BID-IEC) has been introduced. Dynamic Fractional Chaotic Key Generator (DFC-KG) is used to control the key schedule for all encryption and decryption processing. The encryption process consists of the confusion and diffusion steps. In the confusion step, the 2D Arnold Cat Map (ACM) is used with secret parameters taken from DFC-KG. Also, the diffusion step is based on the dynamic chaotic self-invertible secret key matrix which can be generated from the proposed MFC-SM. The IEC key exchange secret parameters are generated based on Elliptic Curve Diffie-Hellman (ECDH) key exchange and the isomorphism parametre. Statistical analysis, differential analysis and key sensitivity tests are performed to estimate the security strengths of the proposed DFC-BID-IEC system. The experimental results show that the proposed algorithm is robust against common signal processing attacks and provides a high security level and high speed for image encryption application.

scholarly journals An Algorithm of Image Encryption Using Logistic and Two-Dimensional Chaotic Economic Maps

Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 44 ◽  
Author(s):  
Sameh Askar ◽  
Abdel Karawia ◽  
Abdulrahman Al-Khedhairi ◽  
Fatemah Al-Ammar
Keyword(s):  
Image Encryption ◽  
Security Level ◽  
Two Dimensional ◽  
Secret Key ◽  
Large Space ◽  
Cryptographic Algorithm ◽  
Key Space ◽  
Contrast Analysis ◽  
Encryption Algorithms ◽  
Made In

In the literature, there are many image encryption algorithms that have been constructed based on different chaotic maps. However, those algorithms do well in the cryptographic process, but still, some developments need to be made in order to enhance the security level supported by them. This paper introduces a new cryptographic algorithm that depends on a logistic and two-dimensional chaotic economic map. The robustness of the introduced algorithm is shown by implementing it on several types of images. The implementation of the algorithm and its security are partially analyzed using some statistical analyses such as sensitivity to the key space, pixels correlation, the entropy process, and contrast analysis. The results given in this paper and the comparisons performed have led us to decide that the introduced algorithm is characterized by a large space of key security, sensitivity to the secret key, few coefficients of correlation, a high contrast, and accepted information of entropy. In addition, the results obtained in experiments show that our proposed algorithm resists statistical, differential, brute-force, and noise attacks.

scholarly journals Image Encryption Algorithm Based on a Novel Improper Fractional-Order Attractor and a Wavelet Function Map

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Jian-feng Zhao ◽  
Shu-ying Wang ◽  
Li-tao Zhang ◽  
Xiao-yan Wang
Keyword(s):  
Image Encryption ◽  
Fractional Order ◽  
Three Dimensional ◽  
Wavelet Function ◽  
Encryption Algorithm ◽  
Discrete Wavelet ◽  
State Variables ◽  
Secret Key ◽  
Initial State ◽  
Image Encryption Algorithm

This paper presents a three-dimensional autonomous chaotic system with high fraction dimension. It is noted that the nonlinear characteristic of the improper fractional-order chaos is interesting. Based on the continuous chaos and the discrete wavelet function map, an image encryption algorithm is put forward. The key space is formed by the initial state variables, parameters, and orders of the system. Every pixel value is included in secret key, so as to improve antiattack capability of the algorithm. The obtained simulation results and extensive security analyses demonstrate the high level of security of the algorithm and show its robustness against various types of attacks.

scholarly journals A Three-Dimensional Infinite Collapse Map with Image Encryption

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1221
Author(s):  
Wenhao Yan ◽  
Zijing Jiang ◽  
Xin Huang ◽  
Qun Ding
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Chaotic Behavior ◽  
Security Analysis ◽  
Three Dimensional ◽  
Security Level ◽  
Encryption Scheme ◽  
Encryption Schemes ◽  
Low Dimensional ◽  
Differential Attacks

Chaos is considered as a natural candidate for encryption systems owing to its sensitivity to initial values and unpredictability of its orbit. However, some encryption schemes based on low-dimensional chaotic systems exhibit various security defects due to their relatively simple dynamic characteristics. In order to enhance the dynamic behaviors of chaotic maps, a novel 3D infinite collapse map (3D-ICM) is proposed, and the performance of the chaotic system is analyzed from three aspects: a phase diagram, the Lyapunov exponent, and Sample Entropy. The results show that the chaotic system has complex chaotic behavior and high complexity. Furthermore, an image encryption scheme based on 3D-ICM is presented, whose security analysis indicates that the proposed image encryption scheme can resist violent attacks, correlation analysis, and differential attacks, so it has a higher security level.

scholarly journals Network Security System with Optimized Randomized Multiple Key Exchange Algorithm

2020 ◽  
Vol 9 (3) ◽  
pp. 1075-1080
Keyword(s):  
Network Security ◽  
Elliptic Curve ◽  
Key Exchange ◽  
Memory Requirement ◽  
Secret Key ◽  
Diffie Hellman ◽  
Shared Secret ◽  
Security Properties ◽  
Diffie Hellman Key Exchange ◽  
Shared Secret Key

This paper illustrates three different algorithms to provide shared secret key for security of the system. The proposed three algorithms namely 1) Modified Simple Password Key Exchange Scheme 2) Modified Diffie-Hellman Key exchange Scheme 3) Modified Elliptic Curve Scheme are meant to provide shared secret key for authentication process. Enhancements in terms of memory requirement, storage and other security properties such as authentication among mutual users, fraud prevention, attack etc., prove the validity of the proposed algorithms in proving authentication for the cryptographic identification of networks

A Framework for Image Encryption on Frequency Domain

2019 ◽  
pp. 247-259
Author(s):  
Zhe Liu ◽  
Mee Loong Yang ◽  
Wei Qi Yan
Keyword(s):  
Image Encryption ◽  
Digital Watermarking ◽  
Logistic Map ◽  
Low Frequency ◽  
Singular Value ◽  
Encryption Algorithm ◽  
Discrete Wavelet ◽  
Secret Key ◽  
Value Decomposition ◽  
Image Encryption Algorithm

In this chapter, the authors propose an improved image encryption algorithm based on digital watermarking. The algorithm combines discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) together in a DWT-DCT-SVD framework to improve the robust watermarking technique. The secret image is embedded into both high-frequency and low-frequency sub-bands of the host image; this makes it difficult to be attacked in all the sub-bands. To reduce the size of a secret key, the authors use a logistic map to generate random images so as to replace the host images. They tested the algorithm by using five types of attacks and the results indicate that the proposed algorithm has higher robustness than traditional chaotic scrambling method and the DRPE method. It shows strong resilience against the five types of attacks as well as statistical attacks.

scholarly journals Design and Implementation of High-Performance ECC Processor with Unified Point Addition on Twisted Edwards Curve

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5148
Author(s):  
Md. Mainul Islam ◽  
Md. Selim Hossain ◽  
Moh. Khalid Hasan ◽  
Md. Shahjalal ◽  
Yeong Min Jang
Keyword(s):  
Elliptic Curve ◽  
High Speed ◽  
High Performance ◽  
Security Level ◽  
Prime Field ◽  
Iot Security ◽  
Point Multiplication ◽  
Low Area ◽  
Edwards Curve ◽  
Twisted Edwards Curve

With the swift evolution of wireless technologies, the demand for the Internet of Things (IoT) security is rising immensely. Elliptic curve cryptography (ECC) provides an attractive solution to fulfill this demand. In recent years, Edwards curves have gained widespread acceptance in digital signatures and ECC due to their faster group operations and higher resistance against side-channel attacks (SCAs) than that of the Weierstrass form of elliptic curves. In this paper, we propose a high-speed, low-area, simple power analysis (SPA)-resistant field-programmable gate array (FPGA) implementation of ECC processor with unified point addition on a twisted Edwards curve, namely Edwards25519. Efficient hardware architectures for modular multiplication, modular inversion, unified point addition, and elliptic curve point multiplication (ECPM) are proposed. To reduce the computational complexity of ECPM, the ECPM scheme is designed in projective coordinates instead of affine coordinates. The proposed ECC processor performs 256-bit point multiplication over a prime field in 198,715 clock cycles and takes 1.9 ms with a throughput of 134.5 kbps, occupying only 6543 slices on Xilinx Virtex-7 FPGA platform. It supports high-speed public-key generation using fewer hardware resources without compromising the security level, which is a challenging requirement for IoT security.

scholarly journals Efficient Implementation on Low-Cost SoC-FPGAs of TLSv1.2 Protocol with ECC_AES Support for Secure IoT Coordinators

Electronics ◽  
2019 ◽  
Vol 8 (11) ◽  
pp. 1238 ◽  
Author(s):  
Ahmed Mohamed Bellemou ◽  
Antonio García ◽  
Encarnación Castillo ◽  
Nadjia Benblidia ◽  
Mohamed Anane ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
High Speed ◽  
High Performance ◽  
Performance Enhancement ◽  
Low Cost ◽  
Research Field ◽  
Transport Layer ◽  
Limited Area ◽  
Secret Key ◽  
Elliptic Curve Cryptosystems

Security management for IoT applications is a critical research field, especially when taking into account the performance variation over the very different IoT devices. In this paper, we present high-performance client/server coordinators on low-cost SoC-FPGA devices for secure IoT data collection. Security is ensured by using the Transport Layer Security (TLS) protocol based on the TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256 cipher suite. The hardware architecture of the proposed coordinators is based on SW/HW co-design, implementing within the hardware accelerator core Elliptic Curve Scalar Multiplication (ECSM), which is the core operation of Elliptic Curve Cryptosystems (ECC). Meanwhile, the control of the overall TLS scheme is performed in software by an ARM Cortex-A9 microprocessor. In fact, the implementation of the ECC accelerator core around an ARM microprocessor allows not only the improvement of ECSM execution but also the performance enhancement of the overall cryptosystem. The integration of the ARM processor enables to exploit the possibility of embedded Linux features for high system flexibility. As a result, the proposed ECC accelerator requires limited area, with only 3395 LUTs on the Zynq device used to perform high-speed, 233-bit ECSMs in 413 µs, with a 50 MHz clock. Moreover, the generation of a 384-bit TLS handshake secret key between client and server coordinators requires 67.5 ms on a low cost Zynq 7Z007S device.

scholarly journals Image Encryption Using a Lightweight Stream Encryption Algorithm

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Saeed Bahrami ◽  
Majid Naderi
Keyword(s):  
Correlation Analysis ◽  
Image Encryption ◽  
Multimedia Data ◽  
Encryption Algorithm ◽  
Security Level ◽  
Visual Test ◽  
Differential Analysis ◽  
Real Time Applications ◽  
And Performance ◽  
Present Algorithm

Security of the multimedia data including image and video is one of the basic requirements for the telecommunications and computer networks. In this paper, we consider a simple and lightweight stream encryption algorithm for image encryption, and a series of tests are performed to confirm suitability of the described encryption algorithm. These tests include visual test, histogram analysis, information entropy, encryption quality, correlation analysis, differential analysis, and performance analysis. Based on this analysis, it can be concluded that the present algorithm in comparison to A5/1 and W7 stream ciphers has the same security level, is better in terms of the speed of performance, and is used for real-time applications.

A Framework for Image Encryption on Frequency Domain

2021 ◽  
pp. 328-338
Author(s):  
Zhe Liu ◽  
Mee Loong Yang ◽  
Wei Qi Yan
Keyword(s):  
Image Encryption ◽  
Digital Watermarking ◽  
Logistic Map ◽  
Low Frequency ◽  
Singular Value ◽  
Encryption Algorithm ◽  
Discrete Wavelet ◽  
Secret Key ◽  
Value Decomposition ◽  
Image Encryption Algorithm

In this chapter, the authors propose an improved image encryption algorithm based on digital watermarking. The algorithm combines discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) together in a DWT-DCT-SVD framework to improve the robust watermarking technique. The secret image is embedded into both high-frequency and low-frequency sub-bands of the host image; this makes it difficult to be attacked in all the sub-bands. To reduce the size of a secret key, the authors use a logistic map to generate random images so as to replace the host images. They tested the algorithm by using five types of attacks and the results indicate that the proposed algorithm has higher robustness than traditional chaotic scrambling method and the DRPE method. It shows strong resilience against the five types of attacks as well as statistical attacks.

scholarly journals Image encryption based on elliptic curve cryptosystem

2021 ◽  
Vol 11 (2) ◽  
pp. 1293
Author(s):  
Zahraa Kadhim Obaid ◽  
Najlae Falah Hameed Al Saffar
Keyword(s):  
Elliptic Curve ◽  
Image Encryption ◽  
Signal To Noise Ratio ◽  
Inverse Matrix ◽  
Elliptic Curve Cryptosystem ◽  
Secret Key ◽  
First Case ◽  
The Matrix ◽  
Hilbert Matrix ◽  
Generating Matrix

Image encryption based on elliptic curve cryptosystem and reducing its complexity is still being actively researched. Generating matrix for encryption algorithm secret key together with Hilbert matrix will be involved in this study. For a first case we will need not to compute the inverse matrix for the decryption processing cause the matrix that be generated in encryption step was self invertible matrix. While for the second case, computing the inverse matrix will be required. Peak signal to noise ratio (PSNR), and unified average changing intensity (UACI) will be used to assess which case is more efficiency to encryption the grayscale image.

Sign in / Sign up

Export Citation Format

Share Document