Cryptanalysis of Secure Hash Password Technique (CSHPT) in Linux

EasyChair Preprint 109

Abstract

The very basic aspect when creating user account systems is to provide protection of data and other details. Hence, there is a need to protect the passwords so that even when the hacker steals the database, the user's passwords are secured using various hashing algorithms. Cryptographic hashing functions like MD5, SHA-216 etc. can be easily hacked with powerful hardware near hacker. Moreover, these are not slow functions. There is a need for implementation of slow hashing functions along with salt or pepper added, which can withstand the growing technology utilized by the attacker. Generally, these functions are used in Linux/Unix password database for authentication of users and other security purposes. The slow hashing functions implemented in this paper are PBKDF2, BCrypt, Scrypt and for cryptanalysis, we have used known plaintext attack because of all the brute-force, dictionary attacks become useless when it comes to slow hash functions. So, we are going to implement, analyze the performance of different algorithms and also make comparisons among them.

Keyphrases: Cryptanalysis, Hashes, Hashing function, Linux, Pepper, Performance, hash function, iteration count, known plain-text, salt, slow hash function, slow hash functions, slow hashing function

@booklet{EasyChair:109,
  author    = {Harshavardhan Metla and Vinay Reddy Mallidi and Sai Kiran Chintalapudi and Madhu Viswanatham V},
  title     = {Cryptanalysis of Secure Hash Password Technique (CSHPT) in Linux},
  howpublished = {EasyChair Preprint 109},
  year      = {EasyChair, 2018}}