Anand Kumar Narayanan

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