Q1. Can anyone recommend a program / utility that I can point to a folder and it generates a SHA-1 hash of all contents?
Q2. The md5sum program does not provide checksums for directories. I want to get a single MD5 checksum for the entire contents of a directory, including files in sub-directories. That is, one combined checksum made out of all the files. Is there a way to do this?
Q3. How can I generate a hash value for a file or folder?
Q4. I want to point to a folder and generate hash of all contents. I'm familiar with using md5 folder enumerator which works very well with single files but not folders.
Q5.Anyone know of a decent freeware or donateware hashing program that can hash at the DVD or CD level?
Q6. There are LOTS of ways to hash individual files, even hashing all the files in the folder, but the result still requires you compare individual file hashes to check data integrity. Ideally what I'm looking for gives me a single hash number for an entire disc or folder (and its sub-folders) and does it relatively quickly.
Q7. How to do a HASH check of a Windows dvd.
Summary:
many people are asking for to get a single hash of the folder and its contents, not just individual file hashes or recursive listings of files in a folder which is the same as file hash.
Read further and look at the screenshots for evidence of this new technology
*JUHAX Announce HASHING Technology Breakthrough*
This new technology called JUHAX "Juxtapose unknown homomorphic A(synchronous) X". JUHAX allows you to create a single so called hash code of millions of files. It can check the contents of CDs, DVDs, hard drives, and other types of media and create a single cryptographical hash code. JUHAX technology can also be used for comparing folders and files which is a useful feature if you want to compare the files written to disc with the source files (normally stored on your hard drive). Comparison of DVDs, CDS, USB memory sticks is possible using the technology. The JUHAX technology is built around a search engine which can be used to create search hash codes from random files from different folders. Currently the feature of hashing folders, drives, usb memory sticks, cd/dvds comes in two versions, an asynchronous version allowing up to 3 000 000 files inside a folder to be calculated into a single hash code or JX1 which is synchronous allowing unlimited numbers of file objects. The Asynchronous version differ from the synchronous version by calculating the total by calculating Hashcodes while the synchronous takes input in the order it finds data. The technology is currently under development and beta testing. It is planned to have a low price tag of 20 dollars.
-----------------------------------------------------------
Folder : C:\Documents and Settings\admin\Mina dokument\
File : AnyCount7_Quick_Start_Guide.pdf
Size : 78687
TAG :
Hashcode : B3F2FB70D918DE06D8697E0D71F2B5AB
Info : File HASH
Ext : pdf
Algo : md5
Date Created : 2011-05-21 19:55:53
Date Last Access : 2013-02-04 15:59:54
Date Last Write : 2011-05-21 19:55:53
USize : 76,84 Kb
------------------------------------------------------------
Folder : C:\Documents and Settings\admin\Mina dokument\00csv
File :
Size : 839839447
TAG :
Hashcode : E3682CA117C223CC5EB69D23CE3424D7
Info : JX2 HASH
Ext : (DIR)
Algo : md5
Date Created : 2011-04-16 10:10:17
Date Last Access : 2013-02-04 15:59:08
Date Last Write : 2013-01-11 19:44:18
USize : 800,93 Mb
--------------------------------------------------------------
JX1 = Synchronous JUHAX JX2 = Asynchronous JUHAX
JUHAX Algo + your favorite hash algo
SCREENSHOT one file and one folder hashed example
NOTES: filesystems NTFS, CDFS, UDF are alphabetical meaning it is suitable to use JX1 synchronous mode and if FAT16 or FAT32 filesystems (usually usb stick use fat32) use JX2 asynchronous which is filesystem independent. Example comparing a folder c:\myusbmemory and f:\ (usb memory stick) you must use JX2 and if they are equal hashes are the same ofcourse.
Currently developement of JX2 is able to create hash code of folders containing up to 3 000 000 files and unlimited subfolders. Since JX2 calculation use RAM and it is designed as a 32 bit 64 bit compatible application the memory is limited to 2 gigabyte as usually most programs are. Testing been done possible to get a hashcode of folders up to 3 000 000 sub files using JX2. File name and folder support unicode chinese,japanese,russia etc. unlimited filesize. Largest file hash test is 700 000 Gigabyte(0,7 terabyte) large file successfully hashed.
Screenshot #2
various directories hashed with different algos, hash folder(s) no problem
Supports drag and drop directly from and integrated fileexplorer, drag files and folders
support for network unc paths are planned, you can drag and drop a folder if you have mapped it ofcourse.
Example japanese folder, kopia (swedish for copy) is the copy of that directory, look same HASH code JX1 MD5!
Folder : F:\精密模\dir_japan_模
File :
Size : 43222
TAG :
Hashcode : A307F8DC8801018F71047A30FC2A38E6
Info : JX1 HASH
Ext : (DIR)
Algo : md5
Date Created : 2011-12-15 12:54:31
Date Last Access : 2013-02-04 17:17:42
Date Last Write : 2013-02-01 17:07:21
USize : 42,21 Kb
--------------------------------
Folder : F:\精密模\Kopia av dir_japan_模
File :
Size : 43222
TAG :
Hashcode : A307F8DC8801018F71047A30FC2A38E6
Info : JX1 HASH
Ext : (DIR)
Algo : md5
Date Created : 2013-02-01 17:07:32
Date Last Access : 2013-02-04 17:17:43
Date Last Write : 2013-02-01 17:07:32
USize : 42,21 Kb
--------------------------------
SEARCH HASH
JUHAX technology do also support creating a hashcode of a unique search of files forexample searching for all .mp3 files on a cd it can calculate a Asynchoronous JX2 or Synchronous JX1 hashcode for that current search. IF you search for a*.mp3 files on CD number 1 you will get a hashcode for that search result and you then can compare CD number 2 if you get the same search hashcode for a*.mp3.
Folder hashing can be done either on root level, recursive or particular files and there will be a hashcode generated for that search.
JX1 and JX2 technology is implemented to support following hashing algos:
MD5,SHA1,SHA256,SHA384,SHA512, RIPEMD128, RIPEMD160, RIPEMD256, RIPEMD320,HAVAL128,HAVAL160,HAVAL192,HAVAL224,HAVAL256
FILESYSTEM INFORMATION
The order in which this function returns the file names is dependent on the file system type. With the NTFS file system and CDFS file systems, the names are usually returned in alphabetical order. With FAT file systems, the names are usually returned in the order the files were written to the disk, which may or may not be in alphabetical order. However, as stated previously, these behaviors are not guaranteed.
JUHAX JX1 is synchronous and uses FindNextFile function built in WINDOWS WIN32API DLL Kernel32.dll this means that folders are feed as it find the file alphabetical if using NTFS but to be safe use JUHAX JX2 which is totally filesystem independent, you can compare a folder on a memory stick formatted with FAT32 and a folder on you harddisk using NTFS filesystem, also comparisons with UDF, CDFS for cd and dvd. But test using JX1 synchronous have been successfully comparing CD and a folder on harddisk with same data as the CD-disc, cdfs and ntfs work the same way therefore JX1 can be used.
Note that JX1 and JX2 hashed ofcourse are different since the logic hashing is different, i would recommend only use JX1 for extremely large directories containing more than 3 000 000 files.
Definitions:
short version: a cryptographic hash is, "a deterministic procedure that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that an accidental or intentional change to the data will change the hash value".
A cryptographic hash function is a hash function; that is, an algorithm that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that any (accidental or intentional) change to the data will (with very high probability) change the hash value. The data to be encoded are often called the "message," and the hash value is sometimes called the message digest or simply digest.
The ideal cryptographic hash function has four main properties:
it is easy to compute the hash value for any given message
it is infeasible to generate a message that has a given hash
it is infeasible to modify a message without changing the hash
it is infeasible to find two different messages with the same hash
Cryptographic hash functions have many information security applications, notably in digital signatures, message authentication codes (MACs), and other forms of authentication. They can also be used as ordinary hash functions, to index data in hash tables, for fingerprinting, to detect duplicate data or uniquely identify files, and as checksums to detect accidental data corruption. Indeed, in information security contexts, cryptographic hash values are sometimes called (digital) fingerprints, checksums, or just hash values, even though all these terms stand for functions with rather different properties and purposes.
(source:wikipedia)
Keywords:
implementations of Homomorphic Hashing, hash folders, homomorphic hashing algebra,verifiable computing,Fountain Codes, a clever probabilistic algorithm that allows you break a large file up into a virtually infinite number of small chunks, such that you can collect any subset of those chunks - as long as you collect a few more than the volume of the original file - and be able to reconstruct the original file. JUHAX does the same with files (chunk) by using homomorphic algebra instead of summing files identity (which are inside folders) there is no need to record which order they were combined (JX2 asynchoronous) also note that JX2 takes care of the problem of sum or multiplication by using homomorphic algebra)
TEST
a test using a folder with 30 000 files inside several subfolders, calculating the JX2 hash code, then changing filenames and subfolder names inside the root folder, the again calculating JX2 hash and this was able to produce the same hash again (asynchronous) it does calculate in realtime the identity (content) of the folder (and the files inside)
*********************************************************************************
JUHAX annoncent hachage * Breakthrough Technology Cette nouvelle technologie appelée JUHAX "Juxtapose homomorphique inconnu Un X (synchrone)". JUHAX vous permet de créer un seul code afin dite de hachage des millions de fichiers. Il permet de vérifier le contenu des CD, des DVD, des disques durs et d'autres types de médias et de créer un seul code de hachage cryptographique. JUHAX technologie peut également être utilisée pour comparer des dossiers et des fichiers qui est une fonction utile si vous voulez comparer les fichiers écrits sur le disque avec les fichiers sources (normalement stockés sur votre disque dur). Comparaison des DVD, CD, clés USB est possible avec la technologie. La technologie JUHAX est construit autour d'un moteur de recherche qui peut être utilisé pour créer des codes de hachage de recherche de fichiers aléatoires provenant de différents dossiers. Actuellement, la fonction de hachage de dossiers, lecteurs, clés USB, CD / DVD est disponible en deux versions, une version asynchrone permettant jusqu'à 1 000 000 fichiers dans un dossier doit être calculée en un seul code de hachage ou de la version 2 qui est synchrone permettant illimité nombre d'objets de fichiers. La version asynchrone différer de la version synchrone en calculant le total en calculant les codes de hachage alors que la synchronisation prend en entrée dans l'ordre qu'il trouve des données. La technologie est actuellement en cours de développement et de test bêta. Il est prévu d'avoir une étiquette de prix bas de 20 dollars.
* JUHAX Kündigen Hashing Technologie-Durchbruch * Diese neue Technologie namens JUHAX "Juxtapose unbekannten homomorphen A (synchron) X". JUHAX können Sie einen einzelnen so genannten Hash-Code von Millionen von Dateien zu erstellen. Es kann den Inhalt von CDs, DVDs, Festplatten und andere Arten von Medien und erstellt eine einzelne kryptographische Hash-Code. JUHAX Technologie kann auch für den Vergleich von Ordnern und Dateien, die eine nützliche Funktion, wenn Sie die Dateien geschrieben, um Disc mit den Quelldateien (normalerweise auf Ihrer Festplatte gespeichert) vergleichen wollen verwendet werden. Vergleich von DVDs, CDs, USB-Sticks ist möglich mit der Technologie. Die JUHAX Technologie ist um eine Suchmaschine, die verwendet werden, um die Suche Hash-Codes von zufälligen Dateien aus verschiedenen Ordnern erstellt werden können gebaut. Derzeit ist die Funktion der Hash-Ordner, Laufwerke, USB-Speicher-Sticks, CDs / DVDs kommt in zwei Versionen, eine asynchrone Version ermöglicht bis zu 1 000 000 Dateien in einem Ordner zu einem einzigen Hash-Code oder Version 2 berechnet werden, die synchron ermöglicht unbegrenzt ist Anzahl der Datei-Objekte. Die asynchrone Version von der synchronen Version unterscheiden sich durch die Berechnung der insgesamt durch die Berechnung Hashcodes während die synchrone nimmt die Eingabe in der Reihenfolge findet Daten. Die Technologie ist derzeit in Entwicklung und Beta-Testphase. Es ist geplant, einen niedrigen Preis von 20 Dollar zu haben.
* JUHAXは、ハッシング技術のブレークスルー※を発表 この新技術は、JUHAXが "未知の準同型の（同期）Xを並列する"と呼ばれる。 JUHAXは、数百万のファイルの単一いわゆるハッシュコードを作成することができます。それは、CDやDVD、ハードディスクドライブ、および他のタイプのメディアの内容をチェックして、単一cryptographicalハッシュコードを作成することができます。 JUHAX技術はまた、ソースファイル（通常はハードドライブに格納されている）を使ってディスクに書き込まれたファイルを比較したい場合に便利な機能ですフォルダとファイルを比較するために使用することができます。 DVDやCD、USBメモリスティックの比較が可能な技術を使用しています。 JUHAX技術は、異なるフォルダからランダムファイルから検索ハッシュコードを作成するために使用できる検索エンジンを中心に構築されます。現在ハッシングフォルダ、ドライブ、USBメモリスティック、CD / DVDの機能が無制限許可同期している二つのバージョンは、単一のハッシュコードまたはバージョン2に計算されるフォルダ内の1 000 000ファイルまで可能非同期バージョンで来るファイルオブジェクトの数。非同期バージョンは、同期がデータを見つけるために、入力を受け取りながら、ハッシュコードを計算することにより、合計を計算することにより、同期バージョンとは異なります。技術が発展し、ベータテスト中です。それは20ドルの低価格のタグを持つことが計画されています。
**********************************************************************************
(C) 2010-2013 JUHAX.com
No comments:
Post a Comment