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.
A General Polynomial Selection Method and New Asymptotic Complexities
Overview
Syllabus
A General Polynomial Selection Method and New Asymptotic Complexities for ...
Taught by
TheIACR
Related Courses
-
BCS-042 : Introduction to Algorithm Design
-
A Kilobit Hidden SNFS Discrete Logarithm Computation
-
Asymptotic Analysis for Selection-Mutation Models: Locations and Weights of Limit Singular Measures
-
Partitioning via Non Linear Polynomial Functions - More Compact IBEs from Ideal Lattices
-
Transparent SNARKs from DARK Compilers
-
Polynomial Time Cryptanalytic Extraction of Neural Network Models
