default search action
Anand Kumar Narayanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Andreas Hülsing
, David Joseph
On Round Elimination for Special-Sound Multi-round Identification and the Generality of the Hypercube for MPCitH. CRYPTO (1) 2024: 373-408 - [c6]Anand Kumar Narayanan
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. EUROCRYPT (3) 2024: 160-187 - [i19]Antoine Joux, Anand Kumar Narayanan:
A high dimensional Cramer's rule connecting homogeneous multilinear equations to hyperdeterminants. Electron. Colloquium Comput. Complex. TR24 (2024) - [i18]Anand Kumar Narayanan, Youming Qiao, Gang Tang:
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. IACR Cryptol. ePrint Arch. 2024: 368 (2024) - [i17]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. IACR Cryptol. ePrint Arch. 2024: 904 (2024) - 2023
- [i16]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. CoRR abs/2309.16256 (2023) - [i15]Nicolas Gama, Anand Kumar Narayanan, Ryder LiuLin, Dongze Yue:
An erf Analog for Discrete Gaussian Sampling. IACR Cryptol. ePrint Arch. 2023: 1288 (2023) - 2022
- [i14]Dipayan Das, Antoine Joux, Anand Kumar Narayanan:
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions. IACR Cryptol. ePrint Arch. 2022: 205 (2022) - 2021
- [j3]Javad Doliskani, Anand Kumar Narayanan, Éric Schost:
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. J. Symb. Comput. 105: 199-213 (2021) - [c5]Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan:
Candidate Tree Codes via Pascal Determinant Cubes. APPROX-RANDOM 2021: 54:1-54:22 - 2020
- [c4]Anand Kumar Narayanan, Matthew Weidner:
On Decoding Cohen-Haeupler-Schulman Tree Codes. SODA 2020: 1337-1356 - [i13]Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan:
Candidate Tree Codes via Pascal Determinant Cubes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]Anand Kumar Narayanan
Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 65(10): 6010-6021 (2019) - [i12]Anand Kumar Narayanan
On Decoding Cohen-Haeupler-Schulman Tree Codes. CoRR abs/1909.07413 (2019) - [i11]Antoine Joux, Anand Kumar Narayanan:
Drinfeld modules are not for isogeny based cryptography. IACR Cryptol. ePrint Arch. 2019: 1329 (2019) - 2018
- [j1]Anand Kumar Narayanan
Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules. Finite Fields Their Appl. 54: 335-365 (2018) - [c3]Anand Kumar Narayanan
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. WAIFI 2018: 74-91 - 2017
- [i10]Javad Doliskani, Anand Kumar Narayanan
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. CoRR abs/1712.00669 (2017) - [i9]Anand Kumar Narayanan, Matthew Weidner:
Nearly linear time encodable codes beating the Gilbert-Varshamov bound. CoRR abs/1712.10052 (2017) - 2016
- [c2]Zeyu Guo
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. MFCS 2016: 47:1-47:14 - [i8]Anand Kumar Narayanan:
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. CoRR abs/1604.03072 (2016) - [i7]Anand Kumar Narayanan:
Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication. CoRR abs/1606.00898 (2016) - [i6]Zeyu Guo, Anand Kumar Narayanan, Chris Umans:
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. CoRR abs/1606.04592 (2016) - 2015
- [i5]Anand Kumar Narayanan:
Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules. CoRR abs/1504.07697 (2015) - 2014
- [i4]Ming-Deh A. Huang, Anand Kumar Narayanan:
Computing discrete logarithms in subfields of residue class rings. CoRR abs/1402.6658 (2014) - 2013
- [i3]Ming-Deh A. Huang, Anand Kumar Narayanan
Finding Primitive Elements in Finite Fields of Small Characteristic. CoRR abs/1304.1206 (2013) - [i2]Ming-Deh A. Huang, Anand Kumar Narayanan:
On the relation generation method of Joux for computing discrete logarithms. CoRR abs/1312.1674 (2013)
2000 – 2009
- 2009
- [i1]Ming-Deh A. Huang, Anand Kumar Narayanan:
Folded Algebraic Geometric Codes From Galois Extensions. CoRR abs/0901.1162 (2009) - 2008
- [c1]Giuseppe Caire, Tareq Y. Al-Naffouri, Anand Kumar Narayanan
Impulse noise cancellation in OFDM: an application of compressed sensing. ISIT 2008: 1293-1297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: