Elliptic curve cryptography ensures more safety and reliability than other public key cryptosystems of the same key size.In recent years,the use of elliptic curves in public-key cryptography has increased due to their...Elliptic curve cryptography ensures more safety and reliability than other public key cryptosystems of the same key size.In recent years,the use of elliptic curves in public-key cryptography has increased due to their complexity and reliability.Different kinds of substitution boxes are proposed to address the substitution process in the cryptosystems,including dynamical,static,and elliptic curve-based methods.Conventionally,elliptic curve-based S-boxes are based on prime field GF(p)but in this manuscript;we propose a new technique of generating S-boxes based on mordell elliptic curves over the Galois field GF(2n).This technique affords a higher number of possibilities to generate S-boxes,which helps to increase the security of the cryptosystem.The robustness of the proposed S-boxes against the well-known algebraic and statistical attacks is analyzed to classify its potential to generate confusion and achieve up to the mark results compared to the various schemes.The majority logic criterion results determine that the proposed S-boxes have up to the mark cryptographic strength.展开更多
基金The author extends their gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through the research groups program under Grant Number R.G.P.2/150/42.
文摘Elliptic curve cryptography ensures more safety and reliability than other public key cryptosystems of the same key size.In recent years,the use of elliptic curves in public-key cryptography has increased due to their complexity and reliability.Different kinds of substitution boxes are proposed to address the substitution process in the cryptosystems,including dynamical,static,and elliptic curve-based methods.Conventionally,elliptic curve-based S-boxes are based on prime field GF(p)but in this manuscript;we propose a new technique of generating S-boxes based on mordell elliptic curves over the Galois field GF(2n).This technique affords a higher number of possibilities to generate S-boxes,which helps to increase the security of the cryptosystem.The robustness of the proposed S-boxes against the well-known algebraic and statistical attacks is analyzed to classify its potential to generate confusion and achieve up to the mark results compared to the various schemes.The majority logic criterion results determine that the proposed S-boxes have up to the mark cryptographic strength.
