YoVDO

A General Polynomial Selection Method and New Asymptotic Complexities

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Algorithm Analysis Courses Theoretical Computer Science Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 25-minute conference talk from Asiacrypt 2016 presented by Palash Sarkar and Shashank Singh, delving into a general polynomial selection method and its implications for new asymptotic complexities in cryptography. Gain insights into cutting-edge research in the field of cryptography and its potential applications.

Syllabus

A General Polynomial Selection Method and New Asymptotic Complexities for ...


Taught by

TheIACR

Related Courses

Algorithms, Part II
Princeton University via Coursera Intro to Algorithms
Udacity Analysis of Algorithms
Princeton University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam