Anand Kumar Narayanan

Computer Science · Physical Sciences

4h-index174citations30works2.22yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Coding theory and cryptography(18), Cryptography and Residue Arithmetic(13), Cryptography and Data Security(6), Cellular Automata and Applications(5), Algebraic Geometry and Number Theory(4)

Publications30 total

Accelerating quantum imaginary-time evolution with random measurements
Physical review. A/Physical review, A·2025· 5 citedOpen Access
Post-quantum Online/Offline Signatures
Lecture notes in computer science·2025· 1 cited
Finding dense sublattices as low energy states of a Hamiltonian
Physical Review Research·2024Open Access
Accelerating quantum imaginary-time evolution with random measurements
arXiv (Cornell University)·2024Open Access
On Round Elimination for Special-Sound Multi-round Identification and the Generality of the Hypercube for MPCitH
Lecture notes in computer science·2024· 1 citedOpen Access
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants
Lecture notes in computer science·2024· 6 cited
Finding dense sub-lattices as low-energy states of a Hamiltonian
arXiv (Cornell University)·2023Open Access
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
Journal of Symbolic Computation·2020· 2 citedOpen Access
Candidate Tree Codes via Pascal Determinant Cubes.
Electron. Colloquium Comput. Complex.·2020· 1 cited
On Decoding Cohen-Haeupler-Schulman Tree Codes
Society for Industrial and Applied Mathematics eBooks·2019· 1 citedOpen Access
Polynomial Factorisation using Drinfeld Modules
HAL (Le Centre pour la Communication Scientifique Directe)·2019Open Access
Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound
IEEE Transactions on Information Theory·2019· 3 citedOpen Access
Drinfeld modules are not for isogeny based cryptography.
IACR Cryptology ePrint Archive·2019· 1 cited
Polynomial factorization over finite fields by computing Euler–Poincaré characteristics of Drinfeld modules
Finite Fields and Their Applications·2018· 3 citedOpen Access
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
Lecture notes in computer science·2018· 1 citedOpen Access
Nearly linear time encodable codes beating the Gilbert-Varshamov bound.
arXiv (Cornell University)·2017· 2 citedOpen Access
Drinfeld Modules with Complex Multiplication, Hasse Invariants and\n Factoring Polynomials over Finite Fields
arXiv (Cornell University)·2017· 3 citedOpen Access
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
arXiv (Cornell University)·2016· 1 citedOpen Access
Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication
arXiv (Cornell University)·2016Open Access
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic\n Curves
arXiv (Cornell University)·2016Open Access
page 1 of 2Next →

Frequent Co-authors

Ming-Deh A. Huang(6), Matthew Weidner(3), Nicolas Gama(3), Ioannis Kolotouros(2), David Joseph(2), Javad Doliskani(2), Éric Schost(2), Zeyu Guo(2), Chris Umans(2), David Joseph(2), Giuseppe Caire(1), Tareq Y. Al-Naffouri(1), Youming Qiao(1), Gang Tang(1), Antoine Joux(1), Inbar Ben Yaacov(1), Gil Cohen(1), M. Albrecht(1), James Howe(1), Andreas Hülsing(1)