Anand Kumar Narayanan

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 23

Top Topics

Modular Architecture

High Dimensional

Restrictive Assumptions

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

Publications

Andreas Hülsing, David Joseph, Christian Majenz, Anand Kumar Narayanan
On Round Elimination for Special-Sound Multi-round Identification and the Generality of the Hypercube for MPCitH. CRYPTO (1) (2024)
Andreas Hülsing, David Joseph, Christian Majenz, Anand Kumar Narayanan
On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH. IACR Cryptol. ePrint Arch. 2024 (2024)
Antoine Joux, Anand Kumar Narayanan
A high dimensional Cramer's rule connecting homogeneous multilinear equations to hyperdeterminants. Electron. Colloquium Comput. Complex. (2024)
Anand Kumar Narayanan, Youming Qiao, Gang Tang
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. EUROCRYPT (3) (2024)
Anand Kumar Narayanan, Youming Qiao, Gang Tang
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. IACR Cryptol. ePrint Arch. 2024 (2024)
Júlia Barberà Rodríguez, Nicolas Gama, Anand Kumar Narayanan, David Joseph
On finding dense sub-lattices as low energy states of a quantum Hamiltonian. CoRR (2023)
Nicolas Gama, Anand Kumar Narayanan, Ryder LiuLin, Dongze Yue
An erf Analog for Discrete Gaussian Sampling. IACR Cryptol. ePrint Arch. 2023 (2023)
Dipayan Das, Antoine Joux, Anand Kumar Narayanan
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions. IACR Cryptol. ePrint Arch. 2022 (2022)
Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan
Candidate Tree Codes via Pascal Determinant Cubes. APPROX-RANDOM (2021)
Javad Doliskani, Anand Kumar Narayanan, Éric Schost
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. J. Symb. Comput. 105 (2021)
Anand Kumar Narayanan, Matthew Weidner
On Decoding Cohen-Haeupler-Schulman Tree Codes. SODA (2020)
Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan
Candidate Tree Codes via Pascal Determinant Cubes. Electron. Colloquium Comput. Complex. 27 (2020)
Anand Kumar Narayanan, Matthew Weidner
On Decoding Cohen-Haeupler-Schulman Tree Codes. CoRR (2019)
Antoine Joux, Anand Kumar Narayanan
Drinfeld modules are not for isogeny based cryptography. IACR Cryptol. ePrint Arch. 2019 (2019)
Anand Kumar Narayanan, Matthew Weidner
Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 65 (10) (2019)
Anand Kumar Narayanan
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. WAIFI (2018)
Anand Kumar Narayanan
Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules. Finite Fields Their Appl. 54 (2018)
Javad Doliskani, Anand Kumar Narayanan, Éric Schost
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. CoRR (2017)
Anand Kumar Narayanan, Matthew Weidner
Nearly linear time encodable codes beating the Gilbert-Varshamov bound. CoRR (2017)
Anand Kumar Narayanan
Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication. CoRR (2016)
Zeyu Guo, Anand Kumar Narayanan, Chris Umans
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. MFCS (2016)
Zeyu Guo, Anand Kumar Narayanan, Chris Umans
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. CoRR (2016)
Anand Kumar Narayanan
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. CoRR (2016)
Anand Kumar Narayanan
Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules. CoRR (2015)
Ming-Deh A. Huang, Anand Kumar Narayanan
Computing discrete logarithms in subfields of residue class rings. CoRR (2014)
Ming-Deh A. Huang, Anand Kumar Narayanan
On the relation generation method of Joux for computing discrete logarithms. CoRR (2013)
Ming-Deh A. Huang, Anand Kumar Narayanan
Finding Primitive Elements in Finite Fields of Small Characteristic CoRR (2013)
Ming-Deh A. Huang, Anand Kumar Narayanan
Folded Algebraic Geometric Codes From Galois Extensions CoRR (2009)
Giuseppe Caire, Tareq Y. Al-Naffouri, Anand Kumar Narayanan
Impulse noise cancellation in OFDM: an application of compressed sensing. ISIT (2008)