A General Polynomial Selection Method and New Asymptotic Complexities

A General Polynomial Selection Method and New Asymptotic Complexities

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.