Security is a key factor in today’s fast communicating world. Many cryptographic algorithms are tested and put into use efficiently. Random numbers are used in diverse forms like nonces, secret key, initialization vector, etc. They find place in encryption, digital signature, hashing algorithms. A deterministic algorithms takes an intial seed value as input and produces pseudo random numbers with falsely induced randomness. This research work extensively surveys large set of state-of-the-art PRNGs and categorizes them based on methodology used to produce them. We compared their statistical results obtained from various statistical test tools like NIST SP 800-22, TestU01. Finally, security analyses of various PRNGs were done quantitatively for their key space, key sensitivity, entropy, speed of bit generation, linear complexity. At last, we concluded the results with some future directions for researchers to carry out their research in improving the PRNGs.

The major need of remote user authentication is to verify the authenticity of the user through insecure channel. Till today enormous remote user authentication schemes have been proposed but still some security flaws remains. Some of them are vulnerable to password guessing attack, Id guessing attack, client and server impersonation attack, replay attack, Denial of Service (DoS) attack etc. Besides the security issues many such schemes are supposed to have higher computational and communicational cost. To overcome these challenges a lightweight cryptographic scheme called signcryption has evolved. Signcryption is a logical combination of encryption and digital signature in single step. Thereby it provides necessary security features in less computational cost of 0.97 ms and communication cost of 824 bits. The proposed research work outlines the weakness in Dharminder et al's authentication scheme which is prone to biometric recognition error, offline password guessing attack, impersonation attack and replay attack. Furthermore the proposed study provides a secure multifactor authentication scheme using signcryption based on Hyper Elliptic Curve Cryptography (HECC) and Bio-hash function. The formal security analysis of proposed scheme is done using Burrows-Abadi-Needham logic. The analysis reveals that the proposed scheme is computational and communication efficient and satisfies all the needed security goals. The scheme is also been formally verified using AVISPA tool that confirms that it is resilient to security attacks.