Anand Kumar Narayanan

Orcid: 0000-0002-0106-030X

According to our database1, Anand Kumar Narayanan authored at least 19 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants.
IACR Cryptol. ePrint Arch., 2024

2023
An erf Analog for Discrete Gaussian Sampling.
IACR Cryptol. ePrint Arch., 2023

On finding dense sub-lattices as low energy states of a quantum Hamiltonian.
CoRR, 2023

2022
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions.
IACR Cryptol. ePrint Arch., 2022

2021
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields.
J. Symb. Comput., 2021

2020
Candidate Tree Codes via Pascal Determinant Cubes.
Electron. Colloquium Comput. Complex., 2020

On Decoding Cohen-Haeupler-Schulman Tree Codes.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound.
IEEE Trans. Inf. Theory, 2019

Drinfeld modules are not for isogeny based cryptography.
IACR Cryptol. ePrint Arch., 2019

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

Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

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

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

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2014
Computing discrete logarithms in subfields of residue class rings.
CoRR, 2014

2013
Finding Primitive Elements in Finite Fields of Small Characteristic
CoRR, 2013

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

2009
Folded Algebraic Geometric Codes From Galois Extensions
CoRR, 2009

2008
Impulse noise cancellation in OFDM: an application of compressed sensing.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...