Anand Kumar Narayanan

According to our database, Anand Kumar Narayanan authored at least 24 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Trapdoor one-way functions from tensors.

Anand Kumar Narayanan

IACR Cryptol. ePrint Arch., 2025

Strong Keys for Tensor Isomorphism Cryptography.

Anand Kumar Narayanan

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

A High Dimensional Cramer's Rule Connecting Homogeneous Multilinear Equations to Hyperdeterminants.

Antoine Joux, Anand Kumar Narayanan

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Post-quantum Online/Offline Signatures.

Martin R. Albrecht, Nicolas Gama, James Howe, Anand Kumar Narayanan

Proceedings of the Topics in Cryptology - CT-RSA 2025, 2025

2024

Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants.

Anand Kumar Narayanan, Youming Qiao, Gang Tang

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 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

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

An erf Analog for Discrete Gaussian Sampling.

Nicolas Gama, Anand Kumar Narayanan, Ryder LiuLin, Dongze Yue

IACR Cryptol. ePrint Arch., 2023

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

2022

Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions.

Dipayan Das, Antoine Joux, Anand Kumar Narayanan

IACR Cryptol. ePrint Arch., 2022

2021

Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields.

Javad Doliskani, Anand Kumar Narayanan, Éric Schost

J. Symb. Comput., 2021

Candidate Tree Codes via Pascal Determinant Cubes.

Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan

Proceedings of the Approximation, 2021

2020

On Decoding Cohen-Haeupler-Schulman Tree Codes.

Anand Kumar Narayanan, Matthew Weidner

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound.

Anand Kumar Narayanan, Matthew Weidner

IEEE Trans. Inf. Theory, 2019

Drinfeld modules are not for isogeny based cryptography.

Antoine Joux, Anand Kumar Narayanan

IACR Cryptol. ePrint Arch., 2019

2018

Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules.

Anand Kumar Narayanan

Finite Fields Their Appl., 2018

Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves.

Anand Kumar Narayanan

Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017

Nearly linear time encodable codes beating the Gilbert-Varshamov bound.

Anand Kumar Narayanan, Matthew Weidner

CoRR, 2017

2016

Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication.

Anand Kumar Narayanan

CoRR, 2016

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields.

Zeyu Guo, Anand Kumar Narayanan, Chris Umans

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2014

Computing discrete logarithms in subfields of residue class rings.

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2014

2013

Finding Primitive Elements in Finite Fields of Small Characteristic

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2013

On the relation generation method of Joux for computing discrete logarithms.

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2013

2009

Folded Algebraic Geometric Codes From Galois Extensions

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2009

2008

Impulse noise cancellation in OFDM: an application of compressed sensing.

Giuseppe Caire, Tareq Y. Al-Naffouri, Anand Kumar Narayanan

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008