Advanced Course on 

Group-Based Cryptography

An activity of CONSOLIDER MATHEMATICA

Program

Monday (May 28, 2007)
8:30 - 9:00 REGISTRATION
9:00 - 10:30

Noncommutative Cryptography

Vladimir Shpilrain, The City College of New York
10:30 - 11:00 COFFEE BREAK
11:00 - 12:30

Complexities of Algorithms

Alexei Miasnikov, McGill University
12:30 - 15:00 LUNCH BREAK
Tuesday (May 29, 2007)
9:00 - 10:30

Noncommutative Cryptography

Vladimir Shpilrain, The City College of New York
10:30 - 11:00 COFFEE BREAK
11:00 - 12:30

Complexities of Algorithms

Alexei Miasnikov, McGill University
12:30 - 15:00 LUNCH BREAK
15:00 - 16:50

15:00 - 15:50 Alexander Ushakov, Cryptographic protocols based on combinatorial group theory

16:00-16:50 Francesco Matucci, Cryptanalysis of the Shpilrain-Ushakov protocol in Thompson's group
 
Wednesday (May 30, 2007)
9:00 - 10:30

Noncommutative Cryptography

Vladimir Shpilrain, The City College of New York
10:30 - 11:00 COFFEE BREAK
11:00 - 12:30

Complexities of Algorithms

Alexei Miasnikov, McGill University
12:30 - 15:00 LUNCH BREAK

CULTURAL ACTIVITY AND DINNER
Thursday (May 31, 2007)
9:00 - 10:30

Noncommutative Cryptography

Vladimir Shpilrain, The City College of New York
10:30 - 11:00 COFFEE BREAK
11:00 - 12:30

Complexities of Algorithms

Alexei Miasnikov, McGill University
12:30 - 15:00 LUNCH BREAK
15:00 - 17:50

15:00-15:50 Sasha Radomirovich, Decomposing security: From online banking to the Mathematics

16:00-16:50 Alexander Ushakov, Random van Kampen diagrams and difficulty of the Word Search problem in groups

17:00 - 17:50 Yesem Kurt, A key exchange primitive over Braid Groups based on the (triple) decomposition problem
 
Friday (June 1, 2007)
9:00 - 10:30

Noncommutative Cryptography

Vladimir Shpilrain, The City College of New York
10:30 - 11:00 COFFEE BREAK
11:00 - 12:30

Complexities of Algorithms

Alexei Miasnikov, McGill University
12:30 - 15:00 LUNCH BREAK
15:00 - 16:50

15:00-15:50 Alexander Ushakov, Random annular diagrams and difficulty of the Conjugacy Search problem in groups

16:00-16:50 Alexander Ushakov, Construction of hard instances for search variations of undecidable problems in groups
 
Saturday (June 2, 2007)
9:00 - 10:30

Noncommutative Cryptography

Vladimir Shpilrain, The City College of New York
10:30 - 11:00 COFFEE BREAK
11:00 - 12:30

Complexities of Algorithms

Alexei Miasnikov, McGill University

Last updated: 29/05/2007