Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1

Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1

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.