sam.hadow/tea3-py
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

readme update

Browse Source
This commit is contained in:
sam.hadow
2026-07-07 14:14:02 +02:00
parent 8886b15d8e
commit 2a6205af06
1 changed files with 13 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
+13 -10
View File
@@ -39,16 +39,19 @@ lookup-tables
``` ```
Modes are: Modes are:
1) Classic inspection | Mode | Explanation |
2) Advanced inspection with forced 0 or 1 bits | ---------------------------------------------- | ----------- |
3) Exhaustive variable-change search | 1. Classic inspection | run n steps |
4) S box analysis | 2. Advanced inspection with forced 0 or 1 bits | run n steps but with bits forced to 0 or 1 |
5) Variable XOR | 3. Exhaustive variable-change search | - |
6) F31, F32 analysis | 4. S box analysis | - |
7) Exhaustive XOR search | 5. Variable XOR | XOR chosen bits inside a register and check the evolution during n steps |
8) Cube attack search | 6. F31, F32 analysis | - |
9) Precompute and save model | 7. Exhaustive XOR search | XOR bits inside a register, returns the best combination (least number of monomials)|
10) Load model | 8. Cube attack search | offline part of the cube attack (a precomputed model can be used) |
| 9. Precompute and save model | precompute n steps and save the model |
| 10. Load model | load a saved model |
n steps can be precomputed and then loaded for the offline part of the cube attack with the menu entry 9 and 10. n steps can be precomputed and then loaded for the offline part of the cube attack with the menu entry 9 and 10.