Time: Thursday, 6 March, 2014 10:30-12:30
Location: Office, Building 3, UOW
Attendees: Guanqiao Huang, Xing Pan
Recorder: Guanqiao Huang
Objective:
1.Function for Brute-force attack
2.Function for Birthday attack
3.Function for Performance
4.Function for Benchmark
5. Statistics the similar by changing the text
6. Hash Chain
In this meeting, the main idea is to refresh and re contribute what we need to do in the project.
1.Function for Brute-force attack & 2. Birthday attack
Dictionary attack is the main way for perform the brute-force attack in our hash kit.
In this meeting, we make sure the the relation in brute-force attack and birthday attack, birthday attack is the special case in brute-force attack. So we are going to separate these two attacks.
for birthday attack, we will use this formula
Performance and benchmark are very similar things. In performance part. it will analysis the collision and the hash speed. The key is random.After analysis, the report can be output from the performance analyzer.
Benchmark is a function for load the performance report and then compare the hash function.
5. Statistics the similar by changing the text
After each change in the string text, the hash value can be compare automatically by this function. for example, add one blank in each character each time, and compare the hash value. If the similar rate is high, the hash function might have some problem.
6. Hash Chain
Hash Chain not only compare the first hash, the first version Hash Chain is not actually meet the fact. So we need to redesign the Hash Chain.
Some note for objective:
(The note is wrote by Xing Pan and Qing Ren)
