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

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera