YoVDO

Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1

Offered By: TheIACR via YouTube

Tags

Cryptography Courses Graph Theory Courses Group Theory Courses Cryptanalysis Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

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

Related Courses

Internetwork Security
Indian Institute of Technology, Kharagpur via Swayam Classical Cryptosystems and Core Concepts
University of Colorado System via Coursera Cryptography and Information Theory
University of Colorado System via Coursera Cryptography And Network Security
Indian Institute of Technology, Kharagpur via Swayam An Introduction to Cryptography
Coventry University via FutureLearn