diff --git a/UserManual.fodt b/UserManual.fodt index 4f599fe..0f10022 100644 --- a/UserManual.fodt +++ b/UserManual.fodt @@ -1,24 +1,24 @@ - 2014-10-23T21:44:47.490000000PT5H28M1S80LibreOffice/5.3.4.2$Windows_x86 LibreOffice_project/f82d347ccc0be322489bf7da61d7e4ad13fe2ff3QuickHash GUI User Manual (c) Ted Smith 2011 - 20182019-01-09T11:40:10.973000000 + 2014-10-23T21:44:47.490000000PT5H29M9S81LibreOffice/5.4.4.2$MacOSX_X86_64 LibreOffice_project/2524958677847fb3bb44820e40380acbe820f960QuickHash GUI User Manual (c) Ted Smith 2011 - 20192019-01-09T17:53:31.071526092 - 716194 + 757509 0 - 38269 - 16358 + 22932 + 10724 true false view2 - 14847 - 731471 + 5756 + 57916 0 - 716194 - 38268 - 732550 + 757509 + 22931 + 768232 0 0 false @@ -29,90 +29,90 @@ - false - - - - 1 - true + true + true + 0 + true + true + false + true + + false + false + false + false + false + false + false + false + false false false - true - false - false - true - true - - true - - false - 0 - true - false - false - true - 0 - false - true - false - high-resolution false + false + true + false + true + true + false + false + + + false false - false - false - false - false - true - false - false + 0 + false false - false + false + true + 1 + false + 532311 + false + false + false + + false + true + false + true - false + true true - false - - false - false - false + true + false + false + false + false + false + false + false + false + + false + high-resolution + false false + true + + 9376631 true - false - 532311 - false - false - false false - false - 9334655 - false + false false - true - false - false - false - false - false - false - false - true - 0 - true - false - false - true - true - true - false - true - false - true + false false - false - true - - false false + true + false + true + false + false + true + 0 + false + true + true @@ -139,7 +139,7 @@ - + @@ -1688,7 +1688,7 @@ - QuickHash GUI User Manual (c) Ted Smith 2011 - 2018 Page 24 of 26 + QuickHash GUI User Manual (c) Ted Smith 2011 - 2019Page 26of 27 @@ -1711,7 +1711,7 @@ - + QuickHash GUI @@ -1725,14 +1725,14 @@ User Manual : v3.0.3 - Copyright (c) 2011-2018 Ted Smith + Copyright (c) 2011-2019 Ted Smith All rights reserved http://www.QuickHash-gui.org (and previously https://sourceforge.net/projects/QuickHash) - 1.0 Pre-amble + 1.0 Pre-amble This manual is designed as a user-aid only. It is not an authority on the subject matter of hashing algorithms, filesystems or anything else, neither in part or in full. The software comes without any warranty, including any future digitally codesigned versions. Use it at your own risk and if you are unsure of any results, please consider cross referencing your findings with other software. There are many free and commercial data hashing tools available to cross-reference your findings. @@ -1770,7 +1770,7 @@ - 2.0 Introduction + 2.0 Introduction QuickHash is quite simply a free, open source, cross platform, fast and easy-to-use data hashing tool for Microsoft Windows, Desktop GNU/Linux distributions like Mint, Zorin OS, and Ubuntu, and Apple Mac Yosemite, Sierra (and hopefully above). @@ -1782,7 +1782,7 @@ Text | File | FileS | Copy | Compare Two Files | Compare Two Folders | Disks | Base64 Data - 2.1 What is a hash? + 2.1 What is a hash? The simplest explanation is that it is like a unique fingerprint of digital data. There are many common hash algorithms, but QuickHash is coded to utilise four of the common mainstream ones : MD5, SHA-1, SHA256 and SHA512 with the inclusion of the increasingly popular xxHash from v2.8.0 of the program. Very basically, if you compute the MD5 value of your typed name, the result is theoretically unique to one in 3.4028...E38, which, put more simply is a probability of one in 340 billion, billion, billion, billion (1 undecillion), meaning that the chances of any other digital data other than that string of characters generating the same hash are infinitely unlikely (engineered collisions aside). @@ -1946,7 +1946,7 @@ QuickHash adopts Merkle–Damgård constructions which theoretically enables a method of building collision-resistant cryptographic hash functions. More can be read about that online. - 2.2 Cross Platform + 2.2 Cross Platform QuickHash was originally designed for Linux to enable less advanced Linux users to easily “and quickly” (|thus the name) generate a list of hash values for files using a simple graphical interface without having to resort to command line tools like SHA1SUM. It was specifically designed to run with live boot CD's like DEFT, CAINE, PALLADIN, HELIX, PARROT SECURITY and others. However, over time, the hashing functionality has improved and indeed now become faster at generating hash values than many other tools – both free and commercial ones. So it is now not only a tool that enables the quick selection of files to hash, but it is also a tool that does compute the hashes quickly. So the name “QuickHash” is really rather fitting. @@ -1972,9 +1972,9 @@ The database is named based on the date and time of Quickhash execution to allow multiple instances of the program to run (a separate database will be created for each instance) from the same launch location. - 3.0 Interface + 3.0 Interface - Tabs Explained – Quick Summary + Tabs Explained – Quick Summary Text : For hashing chunks of text like paragraphs from a file, a name, a character string, a list of values (to be hashed line by line) or public key data that can be copied from somewhere else to QuickHash @@ -1992,7 +1992,7 @@ Base64 Data: New to v2.8.3, it allows the user to hash an encoded Base64 file AND generate a hash of it’s decoded counterpart without the user having to create the decoded version. It also allows the decoding of Base64 encoded data, just for convenience. - 3. Tabs Explained – Detailed Explanation + 3. Tabs Explained – Detailed Explanation 3.1.1 Text : For hashing chunks of text like paragraphs or key data that can be copied from somewhere to QuickHash. You can also type in the text box and QuickHash will dynamically recompute the hash value as you type. The user can also switch the generated hash to one computed by another algorithm simply by clicking one of the other three radio buttons. @@ -2008,7 +2008,7 @@ - + iVBORw0KGgoAAAANSUhEUgAABAIAAALMCAIAAADxcIccAACGQ0lEQVR4nO3dC3wU5aH//4fz O7/z+tkee1ov9UJuQoIthrheIZCEi5RANEraxdSGgFABUVRyahqFtGtaQNN4GqxRClgUCO0B 0oIigdiUSy4k1FsIAZUEyAW8Q3t6avv/nd/vd/jPMzO7O7s7u9lsLrvLfN7tS3bn8swzM5vN @@ -2654,7 +2654,7 @@ - + iVBORw0KGgoAAAANSUhEUgAAA/kAAAIyCAIAAAAff52YAAAAAXNSR0IArs4c6QAAAARnQU1B AACxjwv8YQUAAAAJcEhZcwAADsMAAA7DAcdvqGQAAHQeSURBVHhe7b15mCVXeaeZf09Pz/Qy 7nbPeMbTM3a3u3GVy3bb3cbdBmy8tME0aWfaeANMg2xWUUCR7IhNQmIpCaUoCe2AFlCxligk @@ -3226,7 +3226,7 @@ - + iVBORw0KGgoAAAANSUhEUgAABAEAAAGqCAIAAAD1AsrFAAAAAXNSR0IArs4c6QAAAARnQU1B AACxjwv8YQUAAAAJcEhZcwAADsMAAA7DAcdvqGQAAGbNSURBVHhe7b153CRHeefZf+/s7M6x nvHsetc7u/aMZ7Dk9jljPGPAxscYGdN2vzY2NmAM2IBANNA0N+LSBagRekVL6L4l1AJEi0at @@ -3730,9 +3730,9 @@ 3.1.3 FileS : For hashing multiple files in a directory (aka 'folder') recursively. Put simply, choose a directory and QuickHash will find all the files below that directory and inside its child directories and compute the hashes for all of the files, outputting the results to screen. If you have many files, choosing ‘xxHash’ as your chosen hash algorithm will be considerably quicker than any of the others. - - There are several options in this tab : - + + There are several options in this tab : + @@ -3757,7 +3757,7 @@ - + iVBORw0KGgoAAAANSUhEUgAAB74AAAWACAYAAADOB+lkAAixOUlEQVR4nOzdC1xUdf4//hcw A4M1GBpqWKGhhSVT4Rp2wRrsItU6bmG1SK3UBqzrF2h3laVNdhf9ylLtCv7Kr9C36JvYbun2 d9pcXTeh7Ka5Wo6VbkpKrqSSUlAyOAPzP2euZ24wN66+nj4QZuacM5/zOZ/zOZf3+Xw+MpMA @@ -14316,12 +14316,12 @@ The “Ignoring sub-directories?” enables the user to compute hashes of files in the root of the chosen directory but not any of the files located in the child sub-directories that may be below that chosen root directory. - The “Hidden Folders too?” option requires some detailed explanation. On Windows, hidden files will be found and hashed by default but only if they live in unhidden folders. + The “Hidden Folders too?” option requires some detailed explanation. On Windows, hidden files will be found and hashed by default but only if they live in unhidden folders. Files that live in hidden folders, regardless of whether the files are themselves hidden or unhidden, will not be found unless this option is ticked. By ticking the box however, all files, hidden or unhidden, that live in folders that are either hidden or unhidden, will be found. The screenshots below demonstrate. - + iVBORw0KGgoAAAANSUhEUgAAAXEAAACoCAIAAACZo0mgAAAW6klEQVR4nO2de2wUR57Hq8cP Hn6ATYCsX4DxoMjncD5FQsYDWeUA5cYoUpBYo1MSWdnT2jopJ8MfiD/iUxTJREv4AyNFikyk jcjmdIIgxasIO1lFARtwfLtL5AXysk3Aj2AWDI7B2J5Hd1919zx6eno8U3b3TPf4+5FnqK6p @@ -14438,7 +14438,7 @@ - + iVBORw0KGgoAAAANSUhEUgAAAgcAAAEWCAIAAAB9oaPPAAAxE0lEQVR4nO2de0xcV57nTyT+ m//2r364ijID3lVCSGkUyZRdgO1FzZiEniZbDhqVMSI9gaHDdFJRUG3btKrRYCYlopR7m4wH 02PLGLQisCEKCW5WXhsDDliKVmVSaa0MHReUs937T//Xf3vPua9zn/V+3arvR5Fz77nn/s7v @@ -14680,7 +14680,7 @@ - + iVBORw0KGgoAAAANSUhEUgAAAf4AAAFCCAIAAACfBSh8AAA060lEQVR4nO2de0wcV57vjyX/ t//dv+bhbtpe8L1KCGmtIoU2L9sXDWsSZkO2HbTCGJHZwDJhJ+koqO/YjHrQYjYtorRzh6wX e9aWMWhFYEMUEjxIvjYvh44UXbVJZ3QFTAy0c2fuP/vf/O17Tr2f/e6urqrvR5FTdarqd35V @@ -14939,8 +14939,8 @@ - - The “Choose file types?” feature was added to the “Files” tab in v2.6.4 by user request, meaning the user can recursively hash the content of an entire folder and its sub-folders but only files that have the inputted extension(s) will be analysed. Each value is to be separated by a semi-colon (';'). Note that file header signature analysis is not conducted. + + The “Choose file types?” feature was added to the “Files” tab in v2.6.4 by user request, meaning the user can recursively hash the content of an entire folder and its sub-folders but only files that have the inputted extension(s) will be analysed. Each value is to be separated by a semi-colon (';'). Note that file header signature analysis is not conducted. Since v2.6.4, QuickHash will also find files and folders that exceed the MAX_PATH value of 260 characters imposed by MS Windows. The underlying filesystems of most operating systems, including NTFS, support filenames of much longer than 260 characters, but Windows itself does not currently, even though the underlying filesystem does. It is possible, though, for some software to deliberately exceed this limit, meaning files may exist that the user cannot generally access. With v2.6.4, those files will be found and hashed up to a length of 32K characters for Windows and 4K for Linux. @@ -14949,7 +14949,7 @@ The ‘Start at a time:’ option allows the user to schedule a date and time in the future to start the hashing. However be aware that in development some inconsistencies were noticed with this. It seems to work OK on some processor architectures, but not all. Your mileage may vary so try it before using it for anything important. The “Load Hashlist?’ option is new to v3.0.0 and was perhaps the most frequently requested feature of QuickHash by users over the years. What it enables is for the user to import a list of any number (limit yet to be discovered) of existing hash values that may have been generated at an earlier date by QuickHash or perhaps by another data hashing tool or digital forensics tool. The list must be just one column of hash values without a header row. Once selected QuickHash will rapidly ingest the values. When the user then selects a folder of files, it will compute hashes in the folder and then lookup whether the corresponding hash exists in the list imported by the user (if the tick box is ticked). If it is, it will add “Yes” in the final rightmost column of the display grid. Conversely, if it is not found, QuickHash will display “No”. On completion, three options will be enabled in the right click menu allowing the user to sort or filter out the values as necessary. The column will be empty if no hashlist has been imported. - Note that a bug was identified in May 2018 and fixed in September 2018 with v3.0.3 where lowercase hashlists were not converted to uppercase, meaning values that were the same were not identified as such. This was fixed in v3.0.3 so that all imported lists were converted to uppercase if not already uppercase. + Note that a bug was identified in May 2018 and fixed in September 2018 with v3.0.3 where lowercase hashlists were not converted to uppercase, meaning values that were the same were not identified as such. This was fixed in v3.0.3 so that all imported lists were converted to uppercase if not already uppercase. The list will remain in memory until QuickHash is closed. The list can however be added to after one ingestion if another list needs to be added. Just click the button again to choose a second file of hash values to import and they will be added to the first one. @@ -14963,10 +14963,10 @@ 3.1.4 Copy : The Copy tab allows the user to select a folder containing files he wishes to copy from and another folder where he wishes to copy files to. Both source and destination folders can be a local folder or a mapped network drive or a UNC unmapped network address. Multiple source folders can be selected as the source (using Ctrl and left mouse click) but only one destination folder can be selected as the destination (the original folders will be rebuilt in the destination folder). - Having selected both source and destination folders, upon clicking 'Go', QuickHash will hash the files in the source folder, then copy them to the destination folder (whilst concurrently reconstructing the folder path of the original files, by default) where it then re-hashes the files to check they match the hash values of the original computations. It is, in essence, a “forensic copy and paste”. As with the “FileS” tab, there are options to save the results to CSV or HTML and sub-directories of the source directory can be ignored. Also note that there is an option for the user to not have the source directory structure rebuilt in the destination by ticking the “Don't rebuild path?” option. + Having selected both source and destination folders, upon clicking 'Go', QuickHash will hash the files in the source folder, then copy them to the destination folder (whilst concurrently reconstructing the folder path of the original files, by default) where it then re-hashes the files to check they match the hash values of the original computations. It is, in essence, a “forensic copy and paste”. As with the “FileS” tab, there are options to save the results to CSV or HTML and sub-directories of the source directory can be ignored. Also note that there is an option for the user to not have the source directory structure rebuilt in the destination by ticking the “Don't rebuild path?” option. There are 8 options that are unique to this tab that require explanation. - + Just LIST Directories? @@ -14997,8 +14997,8 @@ The “Choose file types” box allows the user to specify what file types to find, hash, and copy. So for example, if the user is only interested in .doc files, by entering just “.doc;”, only those file types will be found and copied. Multiple extensions can be used if separated with a ';' ONLY (no spaces). Note that this type identification is conducted by filename only – not the more accurate file header signature analysis (which is currently not available in QuickHash). - The “Don't rebuild path?” option allows all files found in the source folder and its sub-folders to simply be dumped in the root of the destination folder without rebuilding the original path in the destination path. Obviously though two files of the same name cannot exist in the same directory on the same filesystem whereas two files of the same name may exist in one folder and any of its other folders. To account for this, when this option is enabled (it is off by default) QuickHash will check for the existence of a file with the same name in the destination directory for each file it copies. Where found, it will rename the second, third, fourth (and so on) instance of the file by renaming it to FileName.ext_DuplicatedNameX where X is the counter of duplicated filenames detected. Note this is not a check of file hash based on content – merely filename and is provided due to filesystem restrictions. - + The “Don't rebuild path?” option allows all files found in the source folder and its sub-folders to simply be dumped in the root of the destination folder without rebuilding the original path in the destination path. Obviously though two files of the same name cannot exist in the same directory on the same filesystem whereas two files of the same name may exist in one folder and any of its other folders. To account for this, when this option is enabled (it is off by default) QuickHash will check for the existence of a file with the same name in the destination directory for each file it copies. Where found, it will rename the second, third, fourth (and so on) instance of the file by renaming it to FileName.ext_DuplicatedNameX where X is the counter of duplicated filenames detected. Note this is not a check of file hash based on content – merely filename and is provided due to filesystem restrictions. + The “Copy hidden files?” is disabled in the Windows version, because hidden files in both hidden and unhidden folders are found by default with this particular tab in QuickHash (different to the 'FileS' tab and its 'Hidden folders too?' tick box). However, in Linux and Apple Mac, the box is enabled, due to the way that files and folders are both, in essence, 'files' on those systems, so a hidden folder needs to be dealt with differently to a hidden file. If you want such files when using either of those systems, tick this box. But Windows users need not be concerned about it. The hashes cannot be dynamically re-computed in this tab, unlike in the first two tabs. @@ -15011,13 +15011,13 @@ Note, however, that if the files that are found are already near to the 260 character limit, but not beyond it, it is likely that when copied, the path length will exceed 260 characters. QuickHash will deal with this by implementing a filesystem bypass. - 3.1.5 Compare Two Files : It is commonly the case that a file exists in two different places, for example, a backup of a file. This tab allows a user to specifically choose one file, and then hash it against another file automatically, perhaps leaving them overnight if they are large. This avoids the need for the user to have to hash all the files in the folder of these two respective files (using the 'FileS' tab), or without the need to hash FileA first, and then manually choosing FileB secondly using the 'File' tab. + 3.1.5 Compare Two Files : It is commonly the case that a file exists in two different places, for example, a backup of a file. This tab allows a user to specifically choose one file, and then hash it against another file automatically, perhaps leaving them overnight if they are large. This avoids the need for the user to have to hash all the files in the folder of these two respective files (using the 'FileS' tab), or without the need to hash FileA first, and then manually choosing FileB secondly using the 'File' tab. - Results can be saved to a text file, if needed, after hashing has completed and by clicking the 'Save As' button. + Results can be saved to a text file, if needed, after hashing has completed and by clicking the 'Save As' button. - + iVBORw0KGgoAAAANSUhEUgAAA/gAAAFUCAIAAAAf+AB8AABvcklEQVR4nO3dDXwU5aEv/ic9 557P9dy/tkdbtZLdBEyw6iZsWytZ8gKBwEJslOjGVDcJgkKKRiGt6VZIu00L6JraxRpLgRYk L9qYrUGRQDCGkBcTrNYlWXwhMSS7wbcqp9r7P7333HvKnWfedmZnZl/yull+33sunX3mmWee @@ -15553,7 +15553,7 @@ Illustration 8: Comparing the hashes of two identical files As of v2.8.1, if the user single mouse clicks the generated hash value, the hash value and the chosen algorithm with be copied to the clipboard. This only applies to the “Compare two Files” tab, for now. - + iVBORw0KGgoAAAANSUhEUgAAAM4AAAB4CAIAAAA17lr7AAANuElEQVR4nO2dDVRUVR7AL4V2 Om27tXnSjBlGAj8QcCpsmYRBcGzM/IgYUkOGoLXWk+uKLY2ZOZLoipRY4XqUFk58+LGSuuGi KBIOIGx+jcNIKogwGKWVbV9n2zote+97b958vfni4xLD/3c843v33Xvf/735vXvvmzfD9Tfq @@ -15627,8 +15627,8 @@ Of of course, the user can just take a screenshot of the results! 3.1.6 Compare Two Folders : This enables the user to compare the file content of two folders. The user must select one folder as the source (Dir A) and then a second folder to compare the source against (Dir B). QuickHash will then count and hash all the files in Dir A and Dir B, storing the values in a list in memory. When complete, it then counts the number of files in each folder and then it hashes them all. If the user does not tick ‘Cont if count differs?’, it will not proceed further and instead report a mis-match as the file count is different, therefore Folder A and Folder B are clearly not the same. However, the user can override this by ticking that box. Then, if there is a mis-match of file count, it will still go on to hash all the files and then report those computed in both Folder A and Folder B. - - The list of hashes is also held in memory where they are then compared very quickly. If both hash lists and the file count match, it will report a match even if the file names are different. This makes QuickHash very fast at this comparison. + + The list of hashes is also held in memory where they are then compared very quickly. If both hash lists and the file count match, it will report a match even if the file names are different. This makes QuickHash very fast at this comparison. If, however, there is a mismatch of hash even if count is the same QuickHash then does go on to compare the hash of each file to work out which ones differ in Folder A to Folder B. The results are saved by default (unless the user unticks ‘Log results?’) to a text file. @@ -15646,7 +15646,7 @@ - + VkNMTVRGAQAxAAAAAQAAAAEAGwAAAAAAAAAAAAAAAAABAAAAAQAAAAEAAAABAAAAATVQAAAw QAAACQAAAIsAAQACAAAAIACNAAEAAgAAAAAAjAABAAAAAACLAAEAAgAAACAAjQABAAIAAAAA AHUAAQD3igAAQk1uDxYAAAAAADYAAAAoAAAACAMAAG0CAAABABgAU0QAATgPFgAAAAAAAAAA @@ -16322,7 +16322,7 @@ - + iVBORw0KGgoAAAANSUhEUgAAA48AAAJKCAIAAAADWefrAADxpUlEQVR4nOzdBVwU2xoA8Jnt oLtbGgmlUUQwQAxsjGtjt3BV7O6Oa1y7O7G7GwsDW0EFAWGB7d23QSzLDOxisL77/X/veZfZ 2TNnzvnmzMfZmYGUlpaGAAAAAAAABSdOnIiOjq7tWgApUm1XAAAAAAAAAFyQrQIAAAAAAM0F @@ -17485,7 +17485,7 @@ 3.2 Unicode - + iVBORw0KGgoAAAANSUhEUgAAAwsAAAFMCAIAAAALBrcQAAAAAXNSR0IArs4c6QAAAARnQU1B AACxjwv8YQUAAAAJcEhZcwAADsMAAA7DAcdvqGQAAF3iSURBVHhe7b2/jhy7kiauB9iH+Lnr DSTIP8bgPMA1tgH1KwiYxXVkaOSOs8Y4OgsIkDHAeGPJO4BwnQHGG/Maax1gzbH2Fe4v/jEY @@ -17961,7 +17961,7 @@ If you value the program, or if your organisation, company or agency does, then please do consider making a donation using https://paypal.me/quickhashgui. Doing so helps fund the AWS server costs and also helps inspire future development. If you give your blessing, news of your support may be published on the website too, although we always ask first so don't let that put you off making a donation! Case studies are also of interest...if QuickHash has helped you with a major task or anything of importance then do please consider submitting a testimonial for the website. Both things are a good opportunity to get your company listed on the website of one of the worlds most widely used data hashing tools; http://QuickHash-gui.org. To donate : www.paypal.me/quickhashgui - + iVBORw0KGgoAAAANSUhEUgAAA94AAASECAYAAACS39c0AAGmoUlEQVR4nOy9B5wlZ3Xmfapu 7DQ55xnNaKRRzoBASCAkgjHRYBvbu/599tpe22uwMc67a/v7vN7FCa9xANtgg8BksMlIiKiI hEA5T449nfvmqvrec956675Vt2737Z65PR2eP9y5dSu+VV1X3U+dc56TLVdrAQEAAAAAAAAA diff --git a/UserManual.pdf b/UserManual.pdf index 8a81f9f..81cbe8b 100644 Binary files a/UserManual.pdf and b/UserManual.pdf differ