mirror of
https://github.com/carlospolop/hacktricks
synced 2024-11-22 04:33:28 +00:00
GitBook: [master] one page and 6 assets modified
This commit is contained in:
parent
35ef979e01
commit
e5c039823f
7 changed files with 27 additions and 1 deletions
BIN
.gitbook/assets/image (107).png
Normal file
BIN
.gitbook/assets/image (107).png
Normal file
Binary file not shown.
After Width: | Height: | Size: 142 KiB |
BIN
.gitbook/assets/image (121).png
Normal file
BIN
.gitbook/assets/image (121).png
Normal file
Binary file not shown.
After Width: | Height: | Size: 160 KiB |
BIN
.gitbook/assets/image (144).png
Normal file
BIN
.gitbook/assets/image (144).png
Normal file
Binary file not shown.
After Width: | Height: | Size: 57 KiB |
BIN
.gitbook/assets/image (73).png
Normal file
BIN
.gitbook/assets/image (73).png
Normal file
Binary file not shown.
After Width: | Height: | Size: 112 KiB |
BIN
.gitbook/assets/image (90).png
Normal file
BIN
.gitbook/assets/image (90).png
Normal file
Binary file not shown.
After Width: | Height: | Size: 92 KiB |
BIN
.gitbook/assets/image (95).png
Normal file
BIN
.gitbook/assets/image (95).png
Normal file
Binary file not shown.
After Width: | Height: | Size: 112 KiB |
|
@ -1,5 +1,20 @@
|
|||
# Cryptographic Algorithms
|
||||
|
||||
## Identifying Algorithms
|
||||
|
||||
Sometimes it's really easy to identify an algorithm thanks to the fact that it needs to use a special and unique value.
|
||||
|
||||
![](../.gitbook/assets/image%20%28121%29.png)
|
||||
|
||||
If you search for the first constant in Google this is what you get:
|
||||
|
||||
![](../.gitbook/assets/image%20%28144%29.png)
|
||||
|
||||
Therefore, you can assume that the decompiled function is a **sha256 calculator.**
|
||||
You can search any of the other constants and you will obtain \(probably\) the same result.
|
||||
|
||||
|
||||
|
||||
## RC4
|
||||
|
||||
It's composed of 3 main parts:
|
||||
|
@ -12,5 +27,16 @@ It's composed of 3 main parts:
|
|||
**In order to identify a RC4 in a disassembly/decompiled code you can check for 2 loops of size 0x100 \(with the use of a key\) and then a XOR of the input data with the 256 values created before in the 2 loops probably using a %256 \(mod 256\)**
|
||||
{% endhint %}
|
||||
|
||||
\*\*\*\*
|
||||
**Example Initialization stage:**
|
||||
\(Note the number 256 used as counter and how a 0 is written in each place of the 256 chars\)
|
||||
|
||||
![](../.gitbook/assets/image%20%2890%29.png)
|
||||
|
||||
**Example of the Scrambling Stage:**
|
||||
|
||||
![](../.gitbook/assets/image%20%28107%29.png)
|
||||
|
||||
**Example of XOR Stage:**
|
||||
|
||||
![](../.gitbook/assets/image%20%2873%29.png)
|
||||
|
||||
|
|
Loading…
Reference in a new issue