Securing Through Pseudorandom Number Generator and Hashing in Cryptography: Review

Abstract

Authentication and confidentiality are two major aspect of the cryptography. In no way you can say that your message is completely secure i.e. any third party can attack you message at any time/stage of processing. For sending confidential messages the security feature is essential to avoid any unauthorized access. We have to encode a message before encryption in ECC as describe by Sir Koblitz. In this paper we employed a new mechanism to secure the value of k by using PRN generator (because of confusion and diffusion) and the value of m by using SHA (for the use of one-way property). Based on the simulated results we achieve strong mechanism of authentication and confidentiality that ultimately enhance the data security.

Keywords: Encoding, Decoding, ECC, PRN, Hash function, Point encryption