-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathideas.txt
More file actions
54 lines (35 loc) · 1.48 KB
/
ideas.txt
File metadata and controls
54 lines (35 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
1.9.2015
by xorpd.
This project will allow saving a database of known/reversing functions, and then
finding similarities between archived functions and functions in new IDBs.
Main plan:
Server:
-------
- Saves a database of all functions known:
For every function:
- sha256 hash (To identify the function 1 to 1)
- Catalog1 hash (To check similarities).
- Reverser's name.
- Function name (As given by the reverser).
- Head comment (As given by the reverser).
- Handles the following request:
- Given a function:
- Search for exact sha256 match. If found, return it.
- Return the function with the closest Catalog1 hash (If it is close enough.
Don't return it if it is has a very low grade).
Client:
-------
- Could be run from outside IDA?
Main functions:
- Find known: Send all functions to the server (The functions themselves).
- Wait for response. For each function, a tuple:
{reverser_name:, func_name:, head_comment, exact_match: } is sent back
- Every function for which a similarity was found will be given a name of the
format: SIMILAR__{grade}__name
The head comment will be changed to contain some more information.
- Commit reversing.
- Send all the functions that were reversed (Given an important name) to the
server. Every function will be sent using the format:
{reverser_name:, func_name: , func_data: ,head_comment: }
- Functions that begin with SIMILAR__ will not be sent.
- Functions without a name will not be sent.