Title | Random Bit Generator Mechanism Based on Elliptic Curves and Secure Hash Function |
Publication Type | Conference Paper |
Year of Publication | 2020 |
Authors | Reyad, O., Karar, M., Hamed, K. |
Conference Name | 2019 International Conference on Advances in the Emerging Computing Technologies (AECT) |
Keywords | cryptographic hash functions, cryptographic tasks, decryption, derivation function, Electronic mail, Elliptic curve cryptography, elliptic curve discrete logarithm problem, Elliptic curves, Encryption, Generators, hard number theoretic problems, Hash Function, Metrics, NIST, pseudorandom bit generator mechanism, pseudorandom bit generators, pubcrawl, public key cryptography, Random Bit Generator, random bit generator mechanism, random number generation, Resiliency, Scalability, secure hash function, security strengths, statistical testing, unpredictability properties |
Abstract | Pseudorandom bit generators (PRBG) can be designed to take the advantage of some hard number theoretic problems such as the discrete logarithm problem (DLP). Such type of generators will have good randomness and unpredictability properties as it is so difficult to find an easy solution to the regarding mathematical dilemma. Hash functions in turn play a remarkable role in many cryptographic tasks to achieve various security strengths. In this paper, a pseudorandom bit generator mechanism that is based mainly on the elliptic curve discrete logarithm problem (ECDLP) and hash derivation function is proposed. The cryptographic hash functions are used in consuming applications that require various security strengths. In a good hash function, finding whatever the input that can be mapped to any pre-specified output is considered computationally infeasible. The obtained pseudorandom bits are tested with NIST statistical tests and it also could fulfill the up-to-date standards. Moreover, a 256 x 256 grayscale images are encrypted with the obtained pseudorandom bits following by necessary analysis of the cipher images for security prove. |
DOI | 10.1109/AECT47998.2020.9194180 |
Citation Key | reyad_random_2020 |