Impulse noise cancellation in OFDM: an application of compressed sensing. - Giuseppe Caire; Tareq Y. Al-Naffouri; Anand Kumar Narayanan (ISIT, 2008)

Folded Algebraic Geometric Codes From Galois Extensions - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2009)

On the relation generation method of Joux for computing discrete logarithms. - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2013)

Finding Primitive Elements in Finite Fields of Small Characteristic - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2013)

Computing discrete logarithms in subfields of residue class rings. - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2014)

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. - Zeyu Guo 001; Anand Kumar Narayanan; Chris Umans (MFCS, 2016)

Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication. - Anand Kumar Narayanan (CoRR, 2016)

Nearly linear time encodable codes beating the Gilbert-Varshamov bound. - Anand Kumar Narayanan; Matthew Weidner (CoRR, 2017)

Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. - Anand Kumar Narayanan (WAIFI, 2018)

Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules. - Anand Kumar Narayanan (Finite Fields Their Appl., 2018)

Drinfeld modules are not for isogeny based cryptography. - Antoine Joux; Anand Kumar Narayanan (IACR Cryptol. ePrint Arch., 2019)

Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound. - Anand Kumar Narayanan; Matthew Weidner (IEEE Trans. Inf. Theory, 2019)

On Decoding Cohen-Haeupler-Schulman Tree Codes. - Anand Kumar Narayanan; Matthew Weidner (SODA, 2020)

Candidate Tree Codes via Pascal Determinant Cubes. - Inbar Ben Yaacov; Gil Cohen; Anand Kumar Narayanan (Electron. Colloquium Comput. Complex., 2020)

Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. - Javad Doliskani; Anand Kumar Narayanan; Éric Schost (J. Symb. Comput., 2021)

Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions. - Dipayan Das 001; Antoine Joux; Anand Kumar Narayanan (IACR Cryptol. ePrint Arch., 2022)

On finding dense sub-lattices as low energy states of a quantum Hamiltonian. - Júlia Barberà Rodríguez; Nicolas Gama; Anand Kumar Narayanan; David Joseph (CoRR, 2023)

An erf Analog for Discrete Gaussian Sampling. - Nicolas Gama; Anand Kumar Narayanan; Ryder LiuLin; Dongze Yue (IACR Cryptol. ePrint Arch., 2023)

A high dimensional Cramer's rule connecting homogeneous multilinear equations to hyperdeterminants. - Antoine Joux; Anand Kumar Narayanan (Electron. Colloquium Comput. Complex., 2024)

On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH. - Andreas Hülsing; David Joseph; Christian Majenz; Anand Kumar Narayanan (IACR Cryptol. ePrint Arch., 2024)

Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. - Anand Kumar Narayanan; Youming Qiao; Gang Tang (IACR Cryptol. ePrint Arch., 2024)

Post-Quantum Online/Offline Signatures. - Martin R. Albrecht; Nicolas Gama; James Howe; Anand Kumar Narayanan (IACR Cryptol. ePrint Arch., 2025)

Trapdoor one-way functions from tensors. - Anand Kumar Narayanan (IACR Cryptol. ePrint Arch., 2025)

Strong keys for tensor isomorphism cryptography. - Anand Kumar Narayanan (IACR Cryptol. ePrint Arch., 2025)