2019/10/12 by Ikram Ullah, Ullah, Ikram, Naveed Ahmed Azam +3 · 1 citation
Computer Science · #Algebraic Geometry (math.AG) #Chaos-based Image/Signal Encryption #Cryptography and Data Security #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1910.05576
openalex publication_date 2019/10/12 · openalex created_date 2022/07/28 · openalex updated_date 2026/07/28
Elliptic curve cryptography has received great attention in recent years due\nto its high resistance against modern cryptanalysis. The aim of this article is\nto present efficient generators to generate substitution boxes (S-boxes) and\npseudo random numbers which are essential for many well-known cryptosystems.\nThese generators are based on a special class of ordered Mordell elliptic\ncurves. Rigorous analyses are performed to test the security strength of the\nproposed generators. For a given prime, the experimental results reveal that\nthe proposed generators are capable of generating a large number of distinct,\nmutually uncorrelated, cryptographically strong S-boxes and sequences of random\nnumbers in low time and space complexity. Furthermore, it is evident from the\ncomparison that the proposed schemes can efficiently generate secure S-boxes\nand random numbers as compared to some of the well-known existing schemes over\ndifferent mathematical structures.\n