From f01717e7a8877fa9e363d08e0b0a0cd7e3c8985a Mon Sep 17 00:00:00 2001 From: PatrickMis <24607131+PatrickMis@users.noreply.github.com> Date: Tue, 16 Jun 2020 19:12:33 +0200 Subject: [PATCH 1/2] Fixed comment and some documentation typos --- examples/hunt.md | 4 ++-- examples/hunt.py | 8 ++++---- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/examples/hunt.md b/examples/hunt.md index 6bfaf79..9d5bff7 100644 --- a/examples/hunt.md +++ b/examples/hunt.md @@ -46,7 +46,7 @@ Running hunt For this example hunt is called with the following command: ``` -hunt example.001 password –chain=256 +hunt example.001 password --chain=256 ``` The options are as follows: @@ -220,7 +220,7 @@ Looking at the FAT volume we can map out the layout of the files. The layout of We can now use hunt to try and locate some headers. hunt is called in exactly the same way as before: ``` -hunt example2.001 password –chain=256 +hunt example2.001 password --chain=256 ``` In this instance, only one header was located at sector 20496. diff --git a/examples/hunt.py b/examples/hunt.py index 9f221c2..3ad086f 100644 --- a/examples/hunt.py +++ b/examples/hunt.py @@ -103,9 +103,9 @@ def chain_search(source_entropy,target): percentage = (float(100) / len(source_entropy)) * x print "\rFinding chains... {}%".format(percentage), if source_entropy[x]: - #contiune chain or start new chain + #continue chain or start new chain if cur_len > -1: - #contiune chain + #continue chain cur_len += 1 else: #start new chain @@ -119,7 +119,7 @@ def chain_search(source_entropy,target): if cur_len >= target: #append current chain to list chains.append([cur_start,cur_len]) - #reset chaiin stats + #reset chain stats cur_start = -1 cur_len = -1 else: @@ -150,7 +150,7 @@ def test_chains(chains,f,hash_options,crypto_options,passwords): #calc start location, searching for the typical location of a normal #backup header and not a hidden header. Changing the -256 will change - #this or increasing the search size will aloow it to be found however + #this or increasing the search size will allow it to be found however #this will be slow search_start = (chain_sector + chain_len - 256 - search_size) * 512 search_end = (chain_sector + chain_len - 256 + search_size) * 512 From c9a778e23103a1e2c107a2ec283b8a217a9581e9 Mon Sep 17 00:00:00 2001 From: PatrickMis <24607131+PatrickMis@users.noreply.github.com> Date: Tue, 16 Jun 2020 19:24:55 +0200 Subject: [PATCH 2/2] Fixed comment and some documentation typos --- examples/ent-chains.py | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/examples/ent-chains.py b/examples/ent-chains.py index 2bed442..22497df 100644 --- a/examples/ent-chains.py +++ b/examples/ent-chains.py @@ -51,9 +51,9 @@ def chain_search(source_entropy,target): percentage = (float(100) / len(source_entropy)) * x print "\rFinding chains... {}%".format(percentage), if source_entropy[x]: - #contiune chain or start new chain + #continue chain or start new chain if cur_len > -1: - #contiune chain + #continue chain cur_len += 1 else: #start new chain @@ -67,7 +67,7 @@ def chain_search(source_entropy,target): if cur_len >= target: #append current chain to list chains.append([cur_start,cur_len]) - #reset chaiin stats + #reset chain stats cur_start = -1 cur_len = -1 else: