Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add the parameter Q to md5 hash function #7

Closed
drazioti opened this issue Feb 6, 2020 · 9 comments
Closed

Add the parameter Q to md5 hash function #7

drazioti opened this issue Feb 6, 2020 · 9 comments
Assignees
Labels
bug Something isn't working

Comments

@drazioti
Copy link
Owner

drazioti commented Feb 6, 2020

#24 After the introduction of md5 hash in unordered map, we must add the parameter Q (where Q is the number of hex bytes we consider from the message digest).

@drazioti drazioti added enhancement New feature or request help wanted Extra attention is needed urgent labels Feb 6, 2020
@drazioti
Copy link
Owner Author

drazioti commented Feb 8, 2020

resolved in pull request #20

@drazioti drazioti closed this as completed Feb 8, 2020
@drazioti drazioti reopened this Feb 9, 2020
@drazioti
Copy link
Owner Author

drazioti commented Feb 9, 2020

bug in the implementation. In each round found the same collisions.

@drazioti drazioti added bug Something isn't working and removed enhancement New feature or request help wanted Extra attention is needed urgent labels Feb 9, 2020
@etiganou
Copy link
Collaborator

etiganou commented Feb 9, 2020

Σε κάθε γύρω του αλγορίθμου δλδ για διαφορετικό I1, I2 ? Γιατί κανονικά αν πούμε για παράδειγμα 3 γινόμενα έχουν ίδιο hash μπαίνουν στο ίδιο vector. Τώρα για κάθε matching hash που δεν σχηματίζει carmichael θα βρίσκει αυτά τα 3 collisions και τα 3 κάθε φορά, αυτό είναι λογικό

@drazioti
Copy link
Owner Author

drazioti commented Feb 9, 2020

For every round (i.e. different choice of I1, I2) always we get the same hashes. For instance

Key: 55368ea18db56
In map: 55368ea18db56
Found a collision
Key: df254c25b2234
In map: df254c25b2234
Found a collision

Then in the next round, new I1,I2 we get the same
and this continues for every round.
Is this logical?

@etiganou
Copy link
Collaborator

etiganou commented Feb 9, 2020

Έχετε δίκιο κάτι πάει λάθος

@etiganou
Copy link
Collaborator

Πάντως για Q_bytes = 12 το έτρεξα μέχρι και για 40000 παράγοντες για 4-5 ώρες και δεν βρήκε καθόλου collisions

@drazioti
Copy link
Owner Author

this does not mean that is working properly. Needs more tests.

@drazioti
Copy link
Owner Author

drazioti commented Feb 11, 2020

The problem remains.

./a.out 15 13 10 5 1 1 1 1 --ham 17 -b 38 -f 1

...
Combination time: 30.056122 seconds
frag = 1
Time for func2 is: 97.724960 seconds
The first set U1, has been stored in memory
Hashtable size : 48903492

Key: 15d28e3b151d9
In map: 15d28e3b151d9	
Found a collision
Key: ca76c1e153b52
In map: ca76c1e153b52	
Found a collision

T set product attack finished 
Size of I is : 38
h1 = 8
h2 = 9
Hash Implementation: True
Combination time: 30.056122 seconds
frag = 1
Time for func2 is: 97.724960 seconds
The first set U1, has been stored in memory
Hashtable size : 48903492

Key: 15d28e3b151d9
In map: 15d28e3b151d9   
Found a collision
Key: ca76c1e153b52
In map: ca76c1e153b52   
Found a collision```

@drazioti
Copy link
Owner Author

drazioti commented Feb 11, 2020

related to #28 #26 #27

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
bug Something isn't working
Projects
None yet
Development

No branches or pull requests

3 participants