Hashing Algorithms Destination - Essay Example

?Running head: HASHING ALGORITHMS Hashing Algorithms Number Introduction Hashing algorithms are used for several purposes like encoding, decoding a particular text or a file, to provide key access to a database, to convert the specified value into another format. Hashing algorithms are generally categorized based on the type of data in which they are used. The most popular hashing algorithms include SHA algorithms which work on the basis of the bit length of the text. Another commonly used algorithm is MD5 and its basic function is to generate hash values to encode and decode the given information. Apart from these algorithms, Whirlpool, Bloom Filters and other algorithms are also widely used. Hashing algorithms are selected based on their efficiency. These hash algorithms depend on a set of hash functions that generate the key values which are in turn stored in a separate table known as the Hash Table. This table follows a unique pattern based on which the values generated in the hash functions are stored. The main aim of a Hashing algorithm is to simplify the intended process and to provide a hassle free operation of the process. By using a hashing algorithm, one can be sure that the data is completely secure. A hashing algorithm tries to solve the complex functionalities by generating a simple function which can be used in place of these complex issues. Origin The hashing algorithm has been in use for many years and almost all the fields make use of these hashing algorithms to help them resolve and simplify their process. Hashing algorithms are generally used to generate a key value or a specified format of number or text to enable the administrator to propose a certain level to the specified data. Given a set of data, a hash function is selected and implemented to produce the hash values. The various types of hashing functions like string hashing, hashing functions for encrypting data and other mathematical values. (Sedgewick & Wyne, 2011). The concept of string hashing is mainly used in database that stores the initial information pertaining to a particular file. The next form is cryptographic hashing, which is used in data conversion and user authentication. The original form of the data is changed by using any of the cryptographic or encryption algorithms, providing a secure environment to the data that is stored in the file. In this function, the original form of the data is changed to the encrypted form which is not readable by the regular user. If a person wants to access that particular file, he has to make use of the hashing function that decrypts the data back to the normal form. The major idea behind this algorithm is to protect the data from outside world. Intrusion and unauthorized access is prevented, thereby giving a protective environment. This algorithm is mostly used to convert the passwords that are used by the user to enter a site or access a particular data. In this case, the encrypted form of the password is stored in the system, instead of the original password. Hence the password and other confidential information are maintained in the organizations and business environment. Though the numbers of hashing algorithms are more, only few are more efficient and effective in dealing with problems. Detailed Description Among the various hashing algorithms, SHA and MD5 algorithms are considered to be more efficient in handling any sort of data. SHA Algorithms SHA algorithm and its versions are one of the best algorithms that help in easing the functionalities and thus the functions are also same for every algorithm. The functions used in each version are different and this depends on the input value of the proposed function. The size of the input and output value also is an important factor, as each function is different in its own form. The versions include SHA1, SHA 384, SHA 256 and SHA 512. Each of these algorithms makes use of functions and constants that define the entire algorithm. These logical functions generally range from f1, f2 and ranges depending on the problems or process’s requirement. (Pieprzyk & Sadeghiyan, 1993). The range of these logical functions also depends on the bit length of the functions. The next important part of the hashing function is the constants that are used for hashing the intended function or process. The value of the constant are indicated as K0, K1 etc. and the cube roots of the foresaid constants. Apart from this, the preprocessing stage also involves certain steps. Original Intension of SHA Algorithm SHA algorithm, generally known as Secure Hash Algorithm has a randomization feature which is considered as the unique feature of a hashing algorithm. SHA algorithm is developed based on the MD algorithms. SHA algorithm was developed by an organization in United States. The organization is better known as National security Authority. Due to this factor, the popularity of SHA algorithm grew faster than they imagined. Since it had all the factors necessary for implementing in any sort of a function, the durability of SHA algorithm is felt in every stage of implementation. SHA 1 is the first Secure Hash Algorithm and the other versions followed similar pattern and it also includes the necessary security protocols. MD Algorithms MD algorithms came into existence during the 1990’s and it was executed by Ron Rivest. Message Digest algorithms generates hash values in hexadecimal format and it is represented in the same form. This hexadecimal string is the converted value of the original data and even a minor change in the original string will affect the hexadecimal string. The MD algorithms include versions like MD2 and MD5. Each version of MD algorithm was developed with an intension to eradicate the backlogs of the previous versions. The inefficiency of the previous versions were also taken into account and modified in the new versions. (Ree, 2003). Apart from analyzing the versions, it is important to examine and analyze the major uses of these algorithms. Primary Purpose of Algorithms Hashing algorithms are primarily used for encryption and authentication and also to protect the data from outside intervention. The hash value is stored in a primary table known as the hash table. In case of authentication, the user’s password value is checked with the hash value that is stored in the hash table. If the values are similar, the user is named as the authorized user, as he passes the phase of authentication. If the user’s password does not match the value stored in the table, the user’s request is denied, resulting in denial of the proposed service. Due to this reason, these hashing algorithms are widely used in places where the user intervention is relatively more. These algorithms acquire a major place in network systems where the security of the stored files is important. Hash functions include an option that does not permit the hacker or the attacker to find out the original password by making use of the reversible function. This is due to the function that restricts the attacker to enter the system. (Federal Information Processing Standards, 2002). This is considered to be the most advantageous option of a hashing algorithm. Another primary use is that the hashing functions propose another option that allows the user or the administrator to transfer the hash value of the password or any data to other systems in the network. By doing this one can be sure that the transmitted password is not revealed to people other than the ones using the systems in the network. The complexity of the algorithm also plays a major role in selecting and implementing these hashing algorithms. Complexity of Hashing Algorithm Any algorithm or an individual function that assists to complete a particular task might eventually include complexities at certain stage of its processing. Considering the MD algorithms the complexities are felt while using with relatively larger systems and values. When compared with the versions like MD 1, MD2, MD4 has more complexities in terms of processing the software at a rapid speed. Even MD5 was found to be lacking in certain qualities, since the original information or the function is the one that is changed or modified. Due to this reason, the process of rectifying or reversing the hash value is certainly a problem. When analyzing the SHA algorithm, one can find out the difference in the key length that varies in each version of the SHA algorithm. Though each version of SHA algorithm like SHA 1, SHA-256 and SHA 512 helps in converting the strings depending on the bits, the process of encrypting becomes a tedious task. In most of the encryption techniques, the key length is equally important, as it decides the level of difficulty in decrypting. (Ree, 2003). Encryption techniques aim at confusing the attacker or hacker, so that he does not get the access to enter into the intended system. These are the major complexities of the commonly used hashing algorithms. Primary Uses The primary use of the algorithm differs in each system and it mainly depends on the type of data in which it is used. The algorithms were first declared as success only after they helped the organizations in dealing with the most complex information or data. When analyzing the algorithms, the organizations found them to be more efficient only for certain type of processes. Since SHA algorithm had the ability to provide better randomization when compared to the other hashing algorithms. This is considered as the first success of this algorithm, as it paved the way for other algorithms to include this essential feature. Failures of Hashing Algorithm The initial versions like SHA 0 included certain problems like delay in time of generating hash values and in padding the initial message to the original and hash value. But these drawbacks were rectified in the versions that came later. Another drawback is the inability to handle the string that has a length greater than the one that the algorithm generates. The input and the output had to be of same length and the length of the string is generally fixed and it cannot be modified. (Sedgewick & Wayne, 2011). In certain cases, the properties of the initial document or the function might be difficult and this eventually the complexity in generating the hash values. Since the level of difficulty is more, the expectations are not met. Though there are certain problems with the existing hashing algorithms, the advanced version provides the users with more efficiency and durability. Future Considerations Considering the present scenario and the problems the algorithms encountered in the past, the future holds very little option for these hashing algorithms. But when compared to the negative aspects, the positive aspects and the benefits are eventually more. Due to this reason, the future will definitely be advantageous to the ones who implement these algorithms. SHA and MD algorithms are still used in many organizations to encrypt and decrypt their confidential information and data. The simple process of MD algorithms is considered as one of the major benefits and due to this factor many organizations still prefer to use MD algorithms. When comparing the MD and SHA algorithms, SHA has more number of users, as even the MD5 does not provide ultimate security. SHA is considered to be more effective, as it provides an extended level of protection and the level of efficiency. Countries like United States make use of SHA algorithm’s latest version in their official operations and to protect the information pertaining to the citizens of America. Conclusion Hashing algorithms provide the user with enormous options to encrypt, convert the original data and to create hash values for the provided information, thereby providing a secure environment to the organization. The latest versions of MD and SHA algorithms provide the user with utmost protection and help them to overcome hassles related to security issues. However, it is proved that SHA algorithm is the most efficient one in dealing with encryption and conversion of data. Hashing mainly refers to converting a given value to its equivalent hash vale which intends to cover up and protect the original information. The efficiency and durability of these hashing algorithms provide the users with numerous benefits and helps them to have a control over the information. The main aim of using a hash function is fulfilled and thus it produces the desired hash value depending on the need of the user. Though there are certain disadvantages and drawbacks in these algorithms, the benefits and other features make it up and thus the users are satisfied with the results provided by these algorithms. This is clearly evident from the fact that these algorithms are being used even now, years after they came into existence. References Sedgewick, R., & Wayne, K. (2011). Algorithms. U.S.A: Pearson Education Inc. Pieprzyk, J., & Sadeghiyan,B. (1993). Design of Algorithms. Michigan: Springer- Verlag. Ree, M. (2003). Internet Security: Cryptographic Principles, Algorithms and Protocols. U.K: John Wiley & Sons. Federal Information Processing Standards. (2002). Secure Hash Standard. Retrieved from: http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf Read More