Ayan Mahalanobis

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 19

Top Topics

Public Key Cryptosystem

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Upendra Kapshikar, Ayan Mahalanobis
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling. Adv. Math. Commun. 17 (6) (2023)
Ansari Abdullah, Ayan Mahalanobis
Minors solve the elliptic curve discrete logarithm problem. CoRR (2023)
Adarsh Srinivasan, Ayan Mahalanobis
A McEliece cryptosystem using permutation codes. CoRR (2021)
Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde, Anupam Singh
Algorithms in Linear Algebraic Groups. CoRR (2020)
Ansari Abdullah, Ayan Mahalanobis, Vivek Mohan Mallick
Initial minors - a conjecture to solve the elliptic curve discrete logarithm problem. CoRR (2020)
Chris Monico, Ayan Mahalanobis
A remark on MAKE - a Matrix Action Key Exchange. CoRR (2020)
Upendra Kapshikar, Ayan Mahalanobis
The Niederreiter cryptosystem and Quasi-Cyclic codes. IACR Cryptol. ePrint Arch. 2019 (2019)
Upendra Kapshikar, Ayan Mahalanobis
The Niederreiter cryptosystem and Quasi-Cyclic codes. CoRR (2019)
Ayan Mahalanobis, Vivek Mohan Mallick, Ansari Abdullah
A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem. INDOCRYPT (2018)
Ayan Mahalanobis, Vivek Mallick
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. IACR Cryptol. ePrint Arch. 2018 (2018)
Upendra Kapshikar, Ayan Mahalanobis
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes. ICETE (2) (2018)
Upendra Kapshikar, Ayan Mahalanobis
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes. CoRR (2018)
Prabhat Kushwaha, Ayan Mahalanobis
A Probabilistic Baby-Step Giant-Step Algorithm. IACR Cryptol. ePrint Arch. 2017 (2017)
Prabhat Kushwaha, Ayan Mahalanobis
A Probabilistic Baby-step Giant-step Algorithm. SECRYPT (2017)
Ayan Mahalanobis, Vivek Mallick
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. CoRR (2017)
Prabhat Kushwaha, Ayan Mahalanobis
A Probabilistic Baby-Step Giant-Step Algorithm. CoRR (2017)
Ayan Mahalanobis, Pralhad Shinde
Bilinear cryptography using finite p-groups of nilpotency class 2. CoRR (2017)
Ayan Mahalanobis, Pralhad Shinde
Bilinear Cryptography Using Groups of Nilpotency Class 2. IMACC (2017)
Ansari Abdullah, Hardik Gajera, Ayan Mahalanobis
On improvements of the $r$-adding walk in a finite field of characteristic 2. CoRR (2016)
Ayan Mahalanobis, Anupam Singh
The MOR Cryptosystem and Unitary group in odd characteristic. CoRR (2014)
Ayan Mahalanobis, Jay Shah
An Improved Guess-and-Determine Attack on the A5/1 Stream Cipher. Comput. Inf. Sci. 7 (1) (2014)
Ayan Mahalanobis, Anupam Singh
MOR Cryptosystem and classical Chevalley groups in odd characteristic. CoRR (2014)
Ayan Mahalanobis
The MOR cryptosystem and finite $p$-groups. CoRR (2013)
Jay Shah, Ayan Mahalanobis
A New Guess-and-Determine Attack on the A5/1 CoRR (2012)
Jay Shah, Ayan Mahalanobis
A New Guess-and-Determine Attack on the A5/1. IACR Cryptol. ePrint Arch. 2012 (2012)
Ayan Mahalanobis
The MOR cryptosystem and extra-special $p$-groups CoRR (2011)
Ayan Mahalanobis
The ElGamal cryptosystem over circulant matrices. IACR Cryptol. ePrint Arch. 2011 (2011)
Ayan Mahalanobis
The ElGamal cryptosystem over circulant matrices CoRR (2011)
Ayan Mahalanobis
The discrete logarithm problem in the group of non-singular circulant matrices. Groups Complex. Cryptol. 2 (1) (2010)
Ayan Mahalanobis
The discrete logarithm problem in the group of non-singular circulant matrices CoRR (2009)
Ayan Mahalanobis
The discrete logarithm problem in the group of non-singular circulant matrices. IACR Cryptol. ePrint Arch. 2009 (2009)
Ayan Mahalanobis
A simple generalization of the ElGamal cryptosystem to non-abelian groups II. IACR Cryptol. ePrint Arch. 2008 (2008)
Ayan Mahalanobis
A simple generalization of the El-Gamal cryptosystem to non-abelian groups II CoRR (2007)
Ayan Mahalanobis
A note on using finite non-abelian p-groups in the MOR cryptosystem CoRR (2007)
Ayan Mahalanobis
A simple generalization of El-Gamal cryptosystem to non-abelian groups. IACR Cryptol. ePrint Arch. 2006 (2006)
Ayan Mahalanobis
A simple generalization of El-Gamal cryptosystem to non-abelian groups CoRR (2006)
Ayan Mahalanobis
The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent groups CoRR (2006)
Ayan Mahalanobis
Diffie-Hellman key exchange protocol and non-abelian nilpotent groups. IACR Cryptol. ePrint Arch. 2005 (2005)
Ayan Mahalanobis
Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups. IACR Cryptol. ePrint Arch. 2005 (2005)
Douglas S. Bridges, Ayan Mahalanobis
Bounded Variation Implies Regulated: A Constructive Proof. J. Symb. Log. 66 (4) (2001)
Douglas S. Bridges, Ayan Mahalanobis
Increasing, Nondecreasing, and Virtually Continuous Functions. J. Autom. Lang. Comb. 6 (2) (2001)
Douglas S. Bridges, Ayan Mahalanobis
Sequential Continuity of Functions in Constructive Analysis. Math. Log. Q. 46 (1) (2000)