Please note that such a hash will never be unique, although if you use an efficient one, you will have a very good chance of never encountering it.
(.. - ), MD5 .
, SHA- 100Kb 10 , , SHA-1 , , MD5.
MessageDigest .
.
, jarnbjo , SHA- Java 20 / x86 . 5-10 100 ( ) , 10 . , , , , .
strong, . SHA 1 - , , Bouncy Castle, , .
( , ):
import java.io.*;
import java.security.MessageDigest;
public class Checksum
{
const string Algorithm = "SHA-1";
public static byte[] createChecksum(String filename) throws
Exception
{
InputStream fis = new FileInputStream(filename);
try
{
byte[] buffer = new byte[1024];
MessageDigest complete = MessageDigest.getInstance("MD5");
int numRead;
do
{
numRead = fis.read(buffer);
if (numRead > 0)
{
complete.update(buffer, 0, numRead);
}
} while (numRead != -1);
return complete.digest();
}
finally
{
fis.close();
}
}
}