Follow
Anand Kumar Narayanan
Anand Kumar Narayanan
Laboratoire d'Informatique de Paris 6, Institut de Mathématiques de Jussieu-Paris Rive Gauche, Sorbonne Universite
Verified email at lip6.fr - Homepage
Title
Cited by
Cited by
Year
Impulse noise cancellation in OFDM: An application of compressed sensing
G Caire, TY Al-Naffouri, AK Narayanan
2008 IEEE international symposium on information theory, 1293-1297, 2008
1612008
Finding primitive elements in finite fields of small characteristic
MD Huang, AK Narayanan
Topics in Finite Fields. Contemporary Mathematics 632, 215-228, 2013
172013
On decoding cohen-haeupler-schulman tree codes
AK Narayanan, M Weidner
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
112020
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
J Doliskani, AK Narayanan, É Schost
Journal of Symbolic Computation 105, 199-213, 2021
102021
Fast computation of isomorphisms between finite fields using elliptic curves
AK Narayanan
International Workshop on the Arithmetic of Finite Fields, 74-91, 2018
102018
Polynomial factorization over finite fields by computing Euler–Poincaré characteristics of Drinfeld modules
AK Narayanan
Finite Fields and Their Applications 54, 335-365, 2018
82018
Folded algebraic geometric codes from Galois extensions
MD Huang, AK Narayanan
Finite Fields: Theory and Applications: Theory and Applications: Ninth …, 2010
82010
Drinfeld modules may not be for isogeny based cryptography
A Joux, AK Narayanan
Cryptology ePrint Archive, 2019
7*2019
Candidate tree codes via Pascal determinant cubes
I Ben Yaacov, G Cohen, AK Narayanan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021
42021
Nearly linear time encodable codes beating the Gilbert-Varshamov bound
AK Narayanan, M Weidner
arXiv: 1712.10052, 2017
4*2017
Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields
Z Guo, AK Narayanan, C Umans
arXiv preprint arXiv:1606.04592, 2016
42016
On the relation generation method of Joux for computing discrete logarithms
MD Huang, AK Narayanan
arXiv preprint arXiv:1312.1674, 2013
42013
The ALTEQ Signature Scheme: Algorithm Specifications and Supporting Documentation
M Bläser, DH Duong, AK Narayanan, T Plantard, Y Qiao, A Sipasseuth, ...
NIST PQC Submission, 2023
22023
Polynomial Factorisation using Drinfeld Modules
AK Narayanan
Newsletter of the London Mathematical Society, 2019
22019
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions
D Das, A Joux, AK Narayanan
Cryptology ePrint Archive, 2022
12022
Computing class groups of function fields using stark units
MD Huang, AK Narayanan
Topics in Finite Fields 632, 193, 2015
12015
Computing discrete logarithms in subfields of residue class rings
MD Huang, AK Narayanan
arXiv preprint arXiv:1402.6658, 2014
12014
Computation of class groups and residue class rings of function fields over finite fields
AK Narayanan
University of Southern California, 2014
12014
Finding isomorphisms between trilinear forms, slightly faster.
AK Narayanan, Y Qiao, G Tang
2024
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants
AK Narayanan, Y Qiao, G Tang
Cryptology ePrint Archive, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20