Image Encryption Using Elliptic Curves and Rossby/Drift Wave Triads

Ullah, Ikram; Hayat, Umar; Bustamante, Miguel D.

doi:10.3390/e22040454

Cited by 18 publications

(19 citation statements)

References 60 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth mentioning that for the RSA algorithm to achieve the same level of security as the ECC technique, it basically requires an increased key length. Although RSA introduces simple computations, the ECC depends on DLP with a lesser key length [37]. Table 2 summarizes the comparative results between RSA, OSS-ECC, and the modified OSS-ECC in signature computation time with respect to key length, which achieved the same security level for all compared schemes.…”

Section: Resultsmentioning

confidence: 96%

See 1 more Smart Citation

A Robust and Hybrid Cryptosystem for Identity Authentication

et al. 2021

View full text Add to dashboard Cite

With the progressive development of a wide range of applications, interconnect things and internet of things (IoT) became an imperative required trend by industries and academicians. IoT became a base infrastructure for remote access or control depending on internet protocol (IP) networks, especially after the COVID-19 pandemic. The huge application domain’s infrastructure, which depends on IoT, requires a trusted connection to guarantee security and privacy while transferring data. This paper proposes a hybrid identity authentication pipeline that integrates three schemes, namely, an elliptic curve cryptography (ECC) scheme is integrated with the Ong, Schnorr, and Shamir (OSS) signature scheme and chaotic maps. The latter satisfies both security and guarantee criteria. The novelty of the proposal is in using chaotic mapping and a cyclic group to deduce a substitution box (S-Box) and a reversible matrix as a portion of the OSS signature equation. The ECC-based security part is an efficient public key cryptography mechanism with less computational cost, which makes it the most convenient to be used in IoT devices for authentication and privacy. The strength of the proposed scheme relies on combining the discrete logarithm problem (DLP) and integer factorization problem (IFP). The proposed approach was simulated using Lab-View and compared with other state-of-the art schemes. Extensive simulation results and analysis of the security and time rendering results confirmed its durability against different types of attacks, such as linear and differential attacks.

show abstract

Section: Resultsmentioning

confidence: 96%

“…Their key-dependent S-box was constructed with the logistic map. Guo et al [37] presented an extended method for designing S-Box based on three-dimensional chaotic Baker maps. This depends on obtaining strong 8 × 8 S-boxes.…”

Section: Substitution-box (S-box) Constructionmentioning

confidence: 99%

A Robust and Hybrid Cryptosystem for Identity Authentication

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Related work: Like chaotic maps, elliptic curves (ECs) are highly sensitive to the initial parameters, and a number of EC-based algorithms have been developed for cryptographic applications [9,[35][36][37][38][39][40][41][42][43][44][45][46][47][48]. Zhang and Wang [40] used the group law for the generation of a public key and encrypted digital images by combining a chaotic system and elliptic curve cryptography (ECC).…”

Section: Introductionmentioning

confidence: 99%

A Novel Image Encryption Scheme Based on Elliptic Curves over Finite Rings

Azam

2022

Entropy

Self Cite

View full text Add to dashboard Cite

Image encryption based on elliptic curves (ECs) is emerging as a new trend in cryptography because it provides high security with a relatively smaller key size when compared with well-known cryptosystems. Recently, it has been shown that the cryptosystems based on ECs over finite rings may provide better security because they require the computational cost for solving the factorization problem and the discrete logarithm problem. Motivated by this fact, we proposed a novel image encryption scheme based on ECs over finite rings. There are three main steps in our scheme, where, in the first step, we mask the plain image using points of an EC over a finite ring. In step two, we create diffusion in the masked image with a mapping from the EC over the finite ring to the EC over the finite field. To create high confusion in the plain text, we generated a substitution box (S-box) based on the ordered EC, which is then used to permute the pixels of the diffused image to obtain a cipher image. With computational experiments, we showed that the proposed cryptosystem has higher security against linear, differential, and statistical attacks than the existing cryptosystems. Furthermore, the average encryption time for color images is lower than other existing schemes.

show abstract

“…Murillo-Escobar et al [37] proposed a new text encryption scheme based on a logistic map. Similarly, elliptic curves (ECs) received great attention in the field of cryptography for image encryption [43][44][45][46][47], text encryption [48][49][50][51][52][53] and signcryption [54][55][56] due to comparable security against modern cryptanalysis with low key size. Sunneetha et al [48] proposed a secure algorithm using elliptic curves and algebraic operations to transmit messages.…”

Section: Introductionmentioning

confidence: 99%

Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

Azhar¹,

Azam²,

Hayat³

2022

Computers, Materials &Amp; Continua

Self Cite

View full text Add to dashboard Cite

The demand for data security schemes has increased with the significant advancement in the field of computation and communication networks. We propose a novel three-step text encryption scheme that has provable security against computation attacks such as key attack and statistical attack. The proposed scheme is based on the Pell sequence and elliptic curves, where at the first step the plain text is diffused to get a meaningless plain text by applying a cyclic shift on the symbol set. In the second step, we hide the elements of the diffused plain text from the attackers. For this purpose, we use the Pell sequence, a weight function, and a binary sequence to encode each element of the diffused plain text into real numbers. The encoded diffused plain text is then confused by generating permutations over elliptic curves in the third step. We show that the proposed scheme has provable security against key sensitivity attack and statistical attacks. Furthermore, the proposed scheme is secure against key spacing attack, ciphertext only attack, and known-plaintext attack. Compared to some of the existing text encryption schemes, the proposed scheme is highly secure against modern cryptanalysis.

show abstract

Image Encryption Using Elliptic Curves and Rossby/Drift Wave Triads

Cited by 18 publications

References 60 publications

A Robust and Hybrid Cryptosystem for Identity Authentication

A Robust and Hybrid Cryptosystem for Identity Authentication

A Novel Image Encryption Scheme Based on Elliptic Curves over Finite Rings

Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

Contact Info

Product

Resources

About