| Popis: |
The hash function is designed to fold an input array of any size into a bit string. For the MD5, this is a very convenient algorithm for comparison and storage. For example, Unix systems use it to store user passwords in a 128-bit encrypted format. It is widely used to check the integrity of files. The length of the output string is 128 bits. When it first appeared, it was impossible to break it, but today this is no longer the case. Many programs select the source word based on the hash. The vast majority of them make an enumeration in the dictionary. However, Rainbow Crack methods are based on generating a set of hashes from a set of characters to search for a hash using the resulting base. Besides, the MD5, like any hash function, has a concept such as collisions - it is about getting the same hashes for different characters' source strings. This paper will propose a method capable of increasing password storage security based on the random generation of an MD5 HASH and then use it to transform the original HASH according to pre-defined rules before storing it in the database. |
