Sotabase

Career

· Former Postdoc, California Institute of Technology

Publications (21)

Finding Primitive Elements in Finite Fields of Small Characteristic
2013
17
cited
Folded Algebraic Geometric Codes From Galois Extensions
2009
9
cited
Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules
2015
8
cited
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields
Journal of symbolic computation · 2017
7
cited
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
2016
6
cited
On Decoding Cohen-Haeupler-Schulman Tree Codes
2019
6
cited
Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound
2017
6
cited
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
International Symposium on Mathematical Foundations of Computer Science · 2016
5
cited
DRINFELD MODULES MAY NOT BE FOR ISOGENY BASED CRYPTOGRAPHY
2020
4
cited
A high dimensional Cramer's rule connecting homogeneous multilinear equations to hyperdeterminants
2024
3
cited
On the relation generation method of Joux for computing discrete logarithms
2013
3
cited
Candidate Tree Codes via Pascal Determinant Cubes
2020
2
cited
Nearly linear time encodable codes beating the Gilbert-Varshamov bound
2017
2
cited
Computation of class groups and residue class rings of function fields over finite fields
2014
1
cited
Drinfeld modules are not for isogeny based cryptography
2019
1
cited
An erf Analog for Discrete Gaussian Sampling
2023
Computing Class Groups of Function Fields Using Stark Units
2013
Computing discrete logarithms in subfields of residue class rings
2014
Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication
2016
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions
2022
Sotabase
Anand Kumar Narayanan | Researcher Profile | Sotabase | Sotabase