Anand Kumar Narayanan
- Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
2016/06/14 by Zeyu Guo, Guo, Zeyu, Anand Kumar Narayanan +3 · 3 citations
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Cryptographic Implementations and Security
- Arithmetic circuit lower bounds from sumset expansion
2026/07/17 by Anand Kumar Narayanan
#cs.CC