default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyan Mahalanobis
Person information
- affiliation: Indian Institute of Science Education Research Pune, India
- affiliation (PhD 2005): Florida Atlantic University, Boca Raton, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Upendra Kapshikar, Ayan Mahalanobis:
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling. Adv. Math. Commun. 17(6): 1476-1492 (2023)- [i32]Ansari Abdullah, Ayan Mahalanobis:
Minors solve the elliptic curve discrete logarithm problem. CoRR abs/2310.04132 (2023) - 2021
- [i31]Adarsh Srinivasan, Ayan Mahalanobis:
A McEliece cryptosystem using permutation codes. CoRR abs/2111.02119 (2021) - 2020
- [i30]Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde, Anupam Singh:
Algorithms in Linear Algebraic Groups. CoRR abs/2003.06292 (2020) - [i29]Ansari Abdullah, Ayan Mahalanobis, Vivek Mohan Mallick:
Initial minors - a conjecture to solve the elliptic curve discrete logarithm problem. CoRR abs/2005.05039 (2020) - [i28]Chris Monico, Ayan Mahalanobis:
A remark on MAKE - a Matrix Action Key Exchange. CoRR abs/2012.00283 (2020)
2010 – 2019
- 2019
- [i27]Upendra Kapshikar, Ayan Mahalanobis:
The Niederreiter cryptosystem and Quasi-Cyclic codes. CoRR abs/1911.00661 (2019) - [i26]Upendra Kapshikar, Ayan Mahalanobis:
The Niederreiter cryptosystem and Quasi-Cyclic codes. IACR Cryptol. ePrint Arch. 2019: 1272 (2019) - 2018
- [c4]Upendra Kapshikar, Ayan Mahalanobis:
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes. ICETE (2) 2018: 506-513 - [c3]Ayan Mahalanobis, Vivek Mohan Mallick, Ansari Abdullah:
A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem. INDOCRYPT 2018: 215-227 - [i25]Upendra Kapshikar, Ayan Mahalanobis:
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes. CoRR abs/1803.07827 (2018) - [i24]Ayan Mahalanobis, Vivek Mallick:
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. IACR Cryptol. ePrint Arch. 2018: 134 (2018) - 2017
- [c2]Ayan Mahalanobis, Pralhad Shinde
:
Bilinear Cryptography Using Groups of Nilpotency Class 2. IMACC 2017: 127-134 - [c1]Prabhat Kushwaha, Ayan Mahalanobis:
A Probabilistic Baby-step Giant-step Algorithm. SECRYPT 2017: 401-406 - [i23]Prabhat Kushwaha, Ayan Mahalanobis:
A Probabilistic Baby-Step Giant-Step Algorithm. CoRR abs/1701.07172 (2017) - [i22]Ayan Mahalanobis, Vivek Mallick:
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. CoRR abs/1703.07544 (2017) - [i21]Ayan Mahalanobis, Pralhad Shinde:
Bilinear cryptography using finite p-groups of nilpotency class 2. CoRR abs/1711.07647 (2017) - [i20]Prabhat Kushwaha, Ayan Mahalanobis:
A Probabilistic Baby-Step Giant-Step Algorithm. IACR Cryptol. ePrint Arch. 2017: 55 (2017) - 2016
- [i19]Ansari Abdullah, Hardik Gajera, Ayan Mahalanobis:
On improvements of the $r$-adding walk in a finite field of characteristic 2. CoRR abs/1601.04134 (2016) - 2014
- [j5]Ayan Mahalanobis, Jay Shah:
An Improved Guess-and-Determine Attack on the A5/1 Stream Cipher. Comput. Inf. Sci. 7(1): 115-124 (2014) - [i18]Ayan Mahalanobis, Anupam Singh:
MOR Cryptosystem and classical Chevalley groups in odd characteristic. CoRR abs/1408.6340 (2014) - [i17]Ayan Mahalanobis, Anupam Singh:
The MOR Cryptosystem and Unitary group in odd characteristic. CoRR abs/1409.6136 (2014) - 2013
- [i16]Ayan Mahalanobis:
The MOR cryptosystem and finite $p$-groups. CoRR abs/1309.1859 (2013) - 2012
- [i15]Jay Shah, Ayan Mahalanobis:
A New Guess-and-Determine Attack on the A5/1. CoRR abs/1204.4535 (2012) - [i14]Jay Shah, Ayan Mahalanobis:
A New Guess-and-Determine Attack on the A5/1. IACR Cryptol. ePrint Arch. 2012: 208 (2012) - 2011
- [i13]Ayan Mahalanobis:
The ElGamal cryptosystem over circulant matrices. CoRR abs/1109.6416 (2011) - [i12]Ayan Mahalanobis:
The MOR cryptosystem and extra-special $p$-groups. CoRR abs/1111.1043 (2011) - [i11]Ayan Mahalanobis:
The ElGamal cryptosystem over circulant matrices. IACR Cryptol. ePrint Arch. 2011: 572 (2011) - 2010
- [j4]Ayan Mahalanobis:
The discrete logarithm problem in the group of non-singular circulant matrices. Groups Complex. Cryptol. 2(1): 83-89 (2010)
2000 – 2009
- 2009
- [i10]Ayan Mahalanobis:
The discrete logarithm problem in the group of non-singular circulant matrices. CoRR abs/0905.3135 (2009) - [i9]Ayan Mahalanobis:
The discrete logarithm problem in the group of non-singular circulant matrices. IACR Cryptol. ePrint Arch. 2009: 190 (2009) - 2008
- [i8]Ayan Mahalanobis:
A simple generalization of the ElGamal cryptosystem to non-abelian groups II. IACR Cryptol. ePrint Arch. 2008: 11 (2008) - 2007
- [i7]Ayan Mahalanobis:
A simple generalization of the El-Gamal cryptosystem to non-abelian groups II. CoRR abs/0706.3305 (2007) - [i6]Ayan Mahalanobis:
A note on using finite non-abelian p-groups in the MOR cryptosystem. CoRR abs/cs/0702095 (2007) - 2006
- [i5]Ayan Mahalanobis:
A simple generalization of El-Gamal cryptosystem to non-abelian groups. CoRR abs/cs/0607011 (2006) - [i4]Ayan Mahalanobis:
The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent groups. CoRR abs/math/0602282 (2006) - [i3]Ayan Mahalanobis:
A simple generalization of El-Gamal cryptosystem to non-abelian groups. IACR Cryptol. ePrint Arch. 2006: 233 (2006) - 2005
- [i2]Ayan Mahalanobis:
Diffie-Hellman key exchange protocol and non-abelian nilpotent groups. IACR Cryptol. ePrint Arch. 2005: 110 (2005) - [i1]Ayan Mahalanobis:
Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups. IACR Cryptol. ePrint Arch. 2005: 223 (2005) - 2001
- [j3]Douglas S. Bridges, Ayan Mahalanobis:
Increasing, Nondecreasing, and Virtually Continuous Functions. J. Autom. Lang. Comb. 6(2): 139-143 (2001) - [j2]Douglas S. Bridges, Ayan Mahalanobis:
Bounded Variation Implies Regulated: A Constructive Proof. J. Symb. Log. 66(4): 1695-1700 (2001) - 2000
- [j1]Douglas S. Bridges, Ayan Mahalanobis:
Sequential Continuity of Functions in Constructive Analysis. Math. Log. Q. 46(1): 139-143 (2000)
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-04-25 05:57 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:
