Block cipher’s nonlinear component design by elliptic curves: an image encryption application

Haider, Muhammad Imran; Ali, Asif; Shah, Dawood; Shah, Tariq

doi:10.1007/s11042-020-09892-5

Cited by 25 publications

(23 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…𝐴 𝑖,𝑗 = 𝐴 𝛿 𝑖 ,𝛿 𝑗 (15) Where Step 3. Next, we will convert the entries of the matrix 𝐴 𝑠 by using the absolute function from the set in the range {−2 15 , 2 15−1 } to the elements of the Galois field 𝐺𝐹(2 15 ). Consequently, get a new matrix 𝐴 𝐺 .…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…Step 4. Subsequently, convert the elements of the Galois field 𝐺𝐹(2 15 ) to the elements of the Galois field 𝐺𝐹(2 8 ) and Galois field 𝐺𝐹(2 7 ) by using the following map.…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…As a result of the above map, we get a new matrix 𝐴 𝑠1 containing elements of the Galois filed 𝐺𝐹(2 15 ).…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…Firstly, generate a sequence 𝜌 of the nonrandom number of lengths 𝑀 × 𝑁. Subsequently, use mode operation and convert the elements of the sequence into the elements of the Galois field 𝐺𝐹(2 15 ). 𝐴 𝑠2 (𝑖, 𝑗) = (𝐴 𝑠1 (𝑖, 𝑗) + (𝜌(𝑖, 𝑗) −1 ) (…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…Where 𝐴 𝑠1 (𝑖, 𝑗) and 𝜌(𝑖, 𝑗) are the elements of the Galois field 𝐺𝐹(2 15 ) and (𝑖, 𝑗) signify integer position in the matrix. Because of the equation ( 18) get a new matrix 𝐴 𝑠2 .…”

Section: Proposed Algorithmmentioning

confidence: 99%

See 4 more Smart Citations

An Efficient Audio Encryption Scheme Based on Finite Fields

Shah

Hazzazi

et al. 2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

Finite fields are well-studied algebraic structures with enormous efficient properties which have applications in the fields of cryptology and coding theory. In this study, we proposed a lossless binary Galois field extension-based efficient algorithm for digital audio encryption. The proposed architecture hired a special type of curve in the diffusion module which depends on efficient elliptic curve arithmetic operations. So, it generates good quality pseudo-random numbers (PRN) and with slight computational efforts, it produces optimum diffusion in the encrypted audio files. For the confusion module, a novel construction mechanism of block cipher has been employed which includes prominent arithmetic operations of binary Galois field inversion and multiplication operations. The suggested scheme generates multiple substitution boxes (S-boxes) by using a higher-order Galois field. Thus, the replacement with multiple S-boxes generates effective perplexity in the data and provides additional security to the ciphered audio. The investigational outcomes through different analyses and time complexity demonstrated the ability of the technique to counter various attacks. Furthermore, as a consequence of a rapid and simple application of the binary finite field in hardware and software, the proposed scheme is more appropriate to be applied for data security.

show abstract

Section: Proposed Algorithmmentioning

confidence: 99%

Section: Proposed Algorithmmentioning

confidence: 99%

“…As a result of the above map, we get a new matrix 𝐴 𝑠1 containing elements of the Galois filed 𝐺𝐹(2 15 ).…”

Section: Proposed Algorithmmentioning

confidence: 99%

Section: Proposed Algorithmmentioning

confidence: 99%

Section: Proposed Algorithmmentioning

confidence: 99%