Completed
Proposed hash (would) have no short collisions.
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Cryptographic Hash Function (CHF)
- 3 Candidates of CHF from graph & group theories
- 4 Constructing Requirements of CHF based on graph & group theories (1/2)
- 5 Collision resistance.
- 6 Comparison with Cayley hash functions
- 7 Preliminaries
- 8 Triplet graph
- 9 An adjacency relation of sextet graph
- 10 Proposed hash (would) have no short collisions.
- 11 The underlying group H of the group word problem
- 12 Possible attacks
- 13 Performance
- 14 Summary & Problems
