2016 - T1 - WS5 - Secrecy and privacy theme

Collection 2016 - T1 - WS5 - Secrecy and privacy theme

Organizer(s) Narayan, Prakash ; Roth, Aaron ; Sarwate, Anand ; Vaikuntanathan, Vinod ; Vadhan, Salil
Date(s) 21/03/2016 - 01/04/2016
linked URL https://web.archive.org/web/20221228152149/http://iss.bu.edu/bobak/csnexus//secrecy.html
00:00:00 / 00:00:00
38 41

Cryptosystems Based on Group-Theoretic Problems: A Survey, New Results, Open Problems

By Delaram Kahrobaei

In this talk I will survey some of the cryptosystems based on group theoretic problems and their computational complexity such as Conjugacy, Membership, Endomorphism, Word, Twisted Conjugacy, and Geodesic Length Problems. I will speak about some non-abelian groups that have been proposed as platforms for such cryptosystems: Braid, Polycyclic, Metabelian, Grigorchuk, Thompson, Matrix, Hyperbolic, Small Cancellation, right angled Artin Groups and free nilpotent p-groups. The focus of the talk will be on infinite polycyclic group-based cryptosystems as well as a cryptosystem based on semidirect product of (semi)-groups. The latter is a joint work with V. Shpilrain. There will be open problems related to both computational complexity of group theoretic problems and cryptographic problems that I will mention at the end of the talk.

Information about the video

  • Date of recording 31/03/2016
  • Date of publication 14/04/2016
  • Institution IHP
  • Licence CC BY-NC-ND
  • Format MP4

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback