| Abstract: | ![]()
ABSTRACT Recent attacks presented for Secure Hash Algorithm -1 (SHA -1) and Message Digest 5 (MD5) have drawn attention of researchers and information security managers to look for a way to secure it. Visibility of information, whether encrypted or not, provides worst kind of vulnerability. Possibility of finding collisions by attackers can be made practically infeasible if statistics related to message digest is denied by hiding the digest. Complicating the process of digest creation may solve the problem temporarily. However it can not discourage the hackers from doing so. If the created digest is hidden in some cover object, it makes difficult for hackers to collect statistics that helps in finding possible collisions. In this paper, we introduce a graph theoretic approach to steganography to hide digest into extra bytes of a Bit Map Pixel (BMP) file. This approach can also be used for securing any fixed length keys during key exchange in Public Key Infrastructure (PKI). |
