| 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 | 170 | 2008 |
| Finding primitive elements in finite fields of small characteristic MD Huang, AK Narayanan Topics in Finite Fields. Contemporary Mathematics 632, 215-228, 2013 | 18 | 2013 |
| On decoding cohen-haeupler-schulman tree codes AK Narayanan, M Weidner Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 11 | 2020 |
| 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 | 10 | 2021 |
| Fast computation of isomorphisms between finite fields using elliptic curves AK Narayanan International Workshop on the Arithmetic of Finite Fields, 74-91, 2018 | 9 | 2018 |
| Drinfeld modules may not be for isogeny based cryptography A Joux, AK Narayanan Cryptology ePrint Archive, 2019 | 8* | 2019 |
| Polynomial factorization over finite fields by computing Euler–Poincaré characteristics of Drinfeld modules AK Narayanan Finite Fields and Their Applications 54, 335-365, 2018 | 8 | 2018 |
| Folded algebraic geometric codes from Galois extensions MD Huang, AK Narayanan Finite Fields: Theory and Applications: Theory and Applications: Ninth …, 2010 | 8 | 2010 |
| 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 | 7 | 2023 |
| 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 | 6 | 2016 |
| Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants AK Narayanan, Y Qiao, G Tang Annual International Conference on the Theory and Applications of …, 2024 | 5 | 2024 |
| Subquadratic time encodable codes beating the gilbert–varshamov bound AK Narayanan, M Weidner IEEE Transactions on Information Theory 65 (10), 6010-6021, 2019 | 5* | 2019 |
| The alteq signature scheme: algorithm specifications and supporting documentation (2023) M Bläser, DH Duong, AK Narayanan, T Plantard, Y Qiao, A Sipasseuth, ... | 5 | |
| Candidate tree codes via Pascal determinant cubes I Ben Yaacov, G Cohen, AK Narayanan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021 | 4 | 2021 |
| On the relation generation method of Joux for computing discrete logarithms MD Huang, AK Narayanan arXiv preprint arXiv:1312.1674, 2013 | 4 | 2013 |
| Accelerating quantum imaginary-time evolution with random measurements I Kolotouros, D Joseph, AK Narayanan Physical Review A 111 (1), 012424, 2025 | 3 | 2025 |
| On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH A Hülsing, D Joseph, C Majenz, AK Narayanan Annual International Cryptology Conference, 373-408, 2024 | 2 | 2024 |
| Polynomial Factorisation using Drinfeld Modules AK Narayanan Newsletter of the London Mathematical Society, 2019 | 2 | 2019 |
| Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions D Das, A Joux, AK Narayanan Cryptology ePrint Archive, 2022 | 1 | 2022 |
| Computing class groups of function fields using stark units MD Huang, AK Narayanan Topics in Finite Fields 632, 193, 2015 | 1 | 2015 |
