Sunday, April 19, 2009

Apakah Itu MD5 Hash

by Your Name 0 comments

Tag


Share this post:
Design Float
StumbleUpon
Reddit

 Apakah Itu MD5 Hash ?Md5 hash dikenal juga dengan nama tool untuk mengecek file dengan nilai 128 byte, seperti finger print dan lain sebagainya.Sangat sedikit kemungkinan kepemilikan 2 identik unik diantara dua  file, Alat ini berguna sebagai kontrol integer 

Bagaimana MD5 ini bekerja 
sebagai contoh tono dan tini mempunyai dua file besar yang mirip,bagimana kita tau bahwa file mereke  berbeda , kita bisa mengitung nya dengan MD5 hashes, sebagi contoh file file yang ada di INdowebster.com, kalao kita mendownload file dari indowebster file akan di md5 hashes 

Act now, and experience the MD5 hash checker utility for yourself, control your data! Download the MD5 hash checker now!

You can learn how to use it from the Online Help or by visiting the main page.

MD5 Hash Properties

The MD5 hash consists of a small amount of binary data, typically no more than 128 bits. All hash values share the following properties:

Hash length

The length of the hash value is determined by the type of the used algorithm, and its length does not depend on the size of the file. The most common hash value lengths are either 128 or 160 bits.

Non-discoverability

Every pair of nonidentical files will translate into a completely different hash value, even if the two files differ only by a single bit. Using today's technology, it is not possible to discover a pair of files that translate to the same hash value.

Repeatability

Each time a particular file is hashed using the same algorithm, the exact same hash value will be produced.

Irreversibility

All hashing algorithms are one-way. Given a checksum value, it is infeasible to discover the password. In fact, none of the properties of the original message can be determined given the checksum value alone.

The algorithm was invented by:

Professor Ronald L. Rivest (born 1947, Schenectady, New York) is a cryptographer, and is the Viterbi Professor of Computer Science at MIT's Department of Electrical Engineering and Computer Science. He is most celebrated for his work on public-key encryption with Len Adleman and Adi Shamir, specifically the RSA algorithm, for which they won the 2002 ACM Turing Award.

Comments 0 comments