Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1

Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1

TheIACR via YouTube Direct link

Intro

1 of 14

1 of 14

Intro

Class Central Classrooms beta

YouTube videos 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. 1 Intro
  2. 2 Cryptographic Hash Function (CHF)
  3. 3 Candidates of CHF from graph & group theories
  4. 4 Constructing Requirements of CHF based on graph & group theories (1/2)
  5. 5 Collision resistance.
  6. 6 Comparison with Cayley hash functions
  7. 7 Preliminaries
  8. 8 Triplet graph
  9. 9 An adjacency relation of sextet graph
  10. 10 Proposed hash (would) have no short collisions.
  11. 11 The underlying group H of the group word problem
  12. 12 Possible attacks
  13. 13 Performance
  14. 14 Summary & Problems

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.