Post-quantum Online/Offline Signatures.

Anand Kumar Narayanan Martin R. Albrecht Nicolas Gama James Howe Anand Kumar Narayanan Post-quantum Online/Offline Signatures. 273-300 2025 CT-RSA https://doi.org/10.1007/978-3-031-88661-4_12 conf/ctrsa/2025 db/conf/ctrsa/ctrsa2025.html#AlbrechtGHN25 streams/conf/ctrsa Antoine Joux Anand Kumar Narayanan A High Dimensional Cramer's Rule Connecting Homogeneous Multilinear Equations to Hyperdeterminants. 62:1-62:16 2025 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2025.62 conf/innovations/2025 db/conf/innovations/innovations2025.html#JouxN25 Anand Kumar Narayanan Strong Keys for Tensor Isomorphism Cryptography. 78:1-78:18 2025 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2025.78 conf/mfcs/2025 db/conf/mfcs/mfcs2025.html#Narayanan25

Anand Kumar Narayanan Hyperdeterminants are hard in four dimensions. TR25-131 2025 TR25 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2025/131 db/journals/eccc/eccc2025.html#Narayanan25

Martin R. Albrecht Nicolas Gama James Howe Anand Kumar Narayanan Post-Quantum Online/Offline Signatures. 117 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/117 db/journals/iacr/iacr2025.html#AlbrechtGHN25 streams/journals/iacr

Anand Kumar Narayanan Trapdoor one-way functions from tensors. 624 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/624 db/journals/iacr/iacr2025.html#Narayanan25 streams/journals/iacr

Anand Kumar Narayanan Strong keys for tensor isomorphism cryptography. 708 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/708 db/journals/iacr/iacr2025.html#Narayanan25a streams/journals/iacr

Andreas Hülsing David Joseph Christian Majenz Anand Kumar Narayanan On Round Elimination for Special-Sound Multi-round Identification and the Generality of the Hypercube for MPCitH. 373-408 2024 CRYPTO (1) https://doi.org/10.1007/978-3-031-68376-3_12 conf/crypto/2024-1 db/conf/crypto/crypto2024-1.html#HulsingJMN24 streams/conf/crypto Anand Kumar Narayanan Youming Qiao Gang Tang Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. 160-187 2024 EUROCRYPT (3) https://doi.org/10.1007/978-3-031-58734-4_6 conf/eurocrypt/2024-3 db/conf/eurocrypt/eurocrypt2024-3.html#NarayananQT24

Antoine Joux Anand Kumar Narayanan A high dimensional Cramer's rule connecting homogeneous multilinear equations to hyperdeterminants. TR24-122 2024 TR24 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2024/122 db/journals/eccc/eccc2024.html#JouxN24

Anand Kumar Narayanan Youming Qiao Gang Tang Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. 368 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/368 db/journals/iacr/iacr2024.html#NarayananQT24

Andreas Hülsing David Joseph Christian Majenz Anand Kumar Narayanan On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH. 904 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/904 db/journals/iacr/iacr2024.html#HulsingJMN24

Júlia Barberà Rodríguez Nicolas Gama Anand Kumar Narayanan David Joseph On finding dense sub-lattices as low energy states of a quantum Hamiltonian. 2023 abs/2309.16256 CoRR https://doi.org/10.48550/arXiv.2309.16256 db/journals/corr/corr2309.html#abs-2309-16256

Nicolas Gama Anand Kumar Narayanan Ryder LiuLin Dongze Yue An erf Analog for Discrete Gaussian Sampling. 1288 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/1288 db/journals/iacr/iacr2023.html#GamaNLY23

Dipayan Das 0001 Antoine Joux Anand Kumar Narayanan Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions. 205 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/205 db/journals/iacr/iacr2022.html#DasJN22

Javad Doliskani Anand Kumar Narayanan Éric Schost Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. 199-213 2021 105 J. Symb. Comput. https://doi.org/10.1016/j.jsc.2020.06.007 https://www.wikidata.org/entity/Q114154457 db/journals/jsc/jsc105.html#DoliskaniNS21

Inbar Ben Yaacov Gil Cohen Anand Kumar Narayanan Candidate Tree Codes via Pascal Determinant Cubes. 54:1-54:22 2021 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.54 conf/approx/2021 db/conf/approx/approx2021.html#YaacovCN21 Anand Kumar Narayanan Matthew Weidner On Decoding Cohen-Haeupler-Schulman Tree Codes. 1337-1356 2020 SODA https://doi.org/10.1137/1.9781611975994.81 conf/soda/2020 db/conf/soda/soda2020.html#NarayananW20

Inbar Ben Yaacov Gil Cohen Anand Kumar Narayanan Candidate Tree Codes via Pascal Determinant Cubes. TR20-141 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/141 db/journals/eccc/eccc27.html#YaacovCN20

Anand Kumar Narayanan Matthew Weidner Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound. 6010-6021 2019 65 IEEE Trans. Inf. Theory 10 https://doi.org/10.1109/TIT.2019.2930538 https://www.wikidata.org/entity/Q127492994 db/journals/tit/tit65.html#NarayananW19

Anand Kumar Narayanan Matthew Weidner On Decoding Cohen-Haeupler-Schulman Tree Codes. 2019 abs/1909.07413 CoRR http://arxiv.org/abs/1909.07413 db/journals/corr/corr1909.html#abs-1909-07413

Antoine Joux Anand Kumar Narayanan Drinfeld modules are not for isogeny based cryptography. 1329 2019 2019 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2019/1329 db/journals/iacr/iacr2019.html#JouxN19

Anand Kumar Narayanan Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules. 335-365 2018 54 Finite Fields Their Appl. https://doi.org/10.1016/j.ffa.2018.08.003 db/journals/ffa/ffa54.html#Narayanan18

Anand Kumar Narayanan Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. 74-91 2018 WAIFI https://doi.org/10.1007/978-3-030-05153-2_4 conf/waifi/2018 db/conf/waifi/waifi2018.html#Narayanan18

Javad Doliskani Anand Kumar Narayanan Éric Schost Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. 2017 abs/1712.00669 CoRR http://arxiv.org/abs/1712.00669 db/journals/corr/corr1712.html#abs-1712-00669

Anand Kumar Narayanan Matthew Weidner Nearly linear time encodable codes beating the Gilbert-Varshamov bound. 2017 abs/1712.10052 CoRR http://arxiv.org/abs/1712.10052 db/journals/corr/corr1712.html#abs-1712-10052

Zeyu Guo 0001 Anand Kumar Narayanan Chris Umans Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. 47:1-47:14 2016 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2016.47 conf/mfcs/2016 db/conf/mfcs/mfcs2016.html#GuoNU16

Anand Kumar Narayanan Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. 2016 abs/1604.03072 CoRR http://arxiv.org/abs/1604.03072 db/journals/corr/corr1604.html#Narayanan16

Anand Kumar Narayanan Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication. 2016 abs/1606.00898 CoRR http://arxiv.org/abs/1606.00898 db/journals/corr/corr1606.html#Narayanan16a

Zeyu Guo 0001 Anand Kumar Narayanan Chris Umans Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. 2016 abs/1606.04592 CoRR http://arxiv.org/abs/1606.04592 db/journals/corr/corr1606.html#GuoNU16

Anand Kumar Narayanan Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules. 2015 abs/1504.07697 CoRR http://arxiv.org/abs/1504.07697 db/journals/corr/corr1504.html#Narayanan15

Ming-Deh A. Huang Anand Kumar Narayanan Computing discrete logarithms in subfields of residue class rings. 2014 abs/1402.6658 CoRR http://arxiv.org/abs/1402.6658 db/journals/corr/corr1402.html#HuangN14

Ming-Deh A. Huang Anand Kumar Narayanan Finding Primitive Elements in Finite Fields of Small Characteristic http://arxiv.org/abs/1304.1206 2013 CoRR abs/1304.1206 db/journals/corr/corr1304.html#abs-1304-1206

Ming-Deh A. Huang Anand Kumar Narayanan On the relation generation method of Joux for computing discrete logarithms. 2013 abs/1312.1674 CoRR http://arxiv.org/abs/1312.1674 db/journals/corr/corr1312.html#HuangN13

Ming-Deh A. Huang Anand Kumar Narayanan Folded Algebraic Geometric Codes From Galois Extensions http://arxiv.org/abs/0901.1162 2009 CoRR abs/0901.1162 db/journals/corr/corr0901.html#abs-0901-1162

Giuseppe Caire Tareq Y. Al-Naffouri Anand Kumar Narayanan Impulse noise cancellation in OFDM: an application of compressed sensing. 1293-1297 2008 ISIT https://doi.org/10.1109/ISIT.2008.4595196 conf/isit/2008 db/conf/isit/isit2008.html#CaireAN08 Tareq Y. Al-Naffouri Martin R. Albrecht Giuseppe Caire Gil Cohen Dipayan Das 0001 Javad Doliskani Nicolas Gama Zeyu Guo 0001 James Howe Ming-Deh A. Huang Andreas Hülsing David Joseph Antoine Joux Ryder LiuLin Christian Majenz Youming Qiao Júlia Barberà Rodríguez Éric Schost Gang Tang Christopher UmansChris Umans Matthew Weidner Inbar Ben Yaacov Dongze Yue