Explore a conference talk on cryptographic hash functions derived from arc-transitive graphs. Delve into the construction requirements, collision resistance, and comparisons with Cayley hash functions. Examine the triplet graph, adjacency relations of sextet graphs, and the underlying group H of the group word problem. Analyze potential attacks, performance considerations, and outstanding challenges in this cutting-edge area of cryptography.
Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1
Overview
Syllabus
Intro
Cryptographic Hash Function (CHF)
Candidates of CHF from graph & group theories
Constructing Requirements of CHF based on graph & group theories (1/2)
Collision resistance.
Comparison with Cayley hash functions
Preliminaries
Triplet graph
An adjacency relation of sextet graph
Proposed hash (would) have no short collisions.
The underlying group H of the group word problem
Possible attacks
Performance
Summary & Problems
Taught by
TheIACR
