S-Boxes Based on Affine Mapping and Orbit of Power Function

Khan, Mubashar; Azam, Naveed Ahmed

doi:10.1007/s13319-015-0043-x

Cited by 19 publications

(7 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different data security schemes have been proposed based on different mathematical structures such as elliptic curves [3][4][5][6][7][8][9], algebraic structures [10][11][12][13][14][15], chaotic maps [16][17][18][19][20][21] and fuzzy set theory [22,23]. Security and privacy of the text messages are major concerns of the users while communicating on popular messaging platforms such as WhatsApp and Signal.…”

Section: Introductionmentioning

confidence: 99%

Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

Azhar¹,

Azam²,

Hayat³

2022

Computers, Materials &Amp; Continua

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

Section: Introductionmentioning

confidence: 99%

Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

Azhar¹,

Azam²,

Hayat³

2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Cryptography has become really handy and image cryptography [3][4][5][6], color image cryptography has been introduced [7] and chocolate cryptography also has been developed [8]. Stegano-cryptosystems introduced as well as researchers have also create new approaches in cryptography including S-Boxes [9][10][11][12][13][14][15][16][17][18][19].…”

Section: Introduction and Historymentioning

confidence: 99%

Cryptography in Terms of Triangular Neutrosophic Numbers with Real Life Applications

admin¹,

Jafar²,

Ahtasham³

et al. 2020

IJNS

View full text Add to dashboard Cite

In this article, our main focus is to put forward the concept of Cryptography in terms of triangular neutrosophic numbers. This kind of cryptography is really reliable, manual, secure, and based on few simple steps. All the encryption and decryption are easy to proceed (mention below). As we know, Public-key cryptography as an indefatigable defender for human privacy and use as information transfer from the ages. various concepts are available with regard to cryptography e.g. Elliptic curve cryptography. TNNC (Triangular neutrosophic numbers cryptography) is familiar with basic concepts of math as well as applicable in different situations e.g. code cryptography, detailed view cryptography, and Graph cryptography encryption facilitate.

show abstract

“…Khan and Azam [12] proposed a method for the construction of multiple S-boxes based on a group action and Gray codes. Similarly, Khan and Azam [13] presented another algorithm for the design of S-boxes based on affine and power mappings. It is shown computationally that all of the newly generated S-boxes have high security against modern attacks.…”

Section: Introductionmentioning

confidence: 99%

An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization

Azam

Hayat

Ullah

2018

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

Elliptic curves (ECs) are considered as one of the highly secure structures against modern computational attacks. In this paper, we present an efficient method based on an ordered isomorphic EC for the generation of a large number of distinct, mutually uncorrelated, and cryptographically strong injective S-boxes. The proposed scheme is characterized in terms of time complexity and the number of the distinct S-boxes. Furthermore, rigorous analysis and comparison of the newly developed method with some of the existing methods are conducted. Experimental results reveal that the newly developed scheme can efficiently generate a large number of distinct, uncorrelated, and secure S-boxes when compared with some of the well-known existing schemes.

show abstract

S-Boxes Based on Affine Mapping and Orbit of Power Function

Cited by 19 publications

References 4 publications

Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

Cryptography in Terms of Triangular Neutrosophic Numbers with Real Life Applications

An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization

Contact Info

Product

Resources

About