Sequential Continuity of Functions in Constructive Analysis. - Douglas S. Bridges; Ayan Mahalanobis (Math. Log. Q., 2000)

Increasing, Nondecreasing, and Virtually Continuous Functions. - Douglas S. Bridges; Ayan Mahalanobis (J. Autom. Lang. Comb., 2001)

Bounded Variation Implies Regulated: A Constructive Proof. - Douglas S. Bridges; Ayan Mahalanobis (J. Symb. Log., 2001)

Diffie-Hellman key exchange protocol and non-abelian nilpotent groups. - Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2005)

Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups. - Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2005)

A simple generalization of El-Gamal cryptosystem to non-abelian groups. - Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2006)

A simple generalization of the El-Gamal cryptosystem to non-abelian groups II - Ayan Mahalanobis (CoRR, 2007)

A note on using finite non-abelian p-groups in the MOR cryptosystem - Ayan Mahalanobis (CoRR, 2007)

A simple generalization of the ElGamal cryptosystem to non-abelian groups II. - Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2008)

The discrete logarithm problem in the group of non-singular circulant matrices. - Ayan Mahalanobis (Groups Complex. Cryptol., 2010)

The MOR cryptosystem and extra-special $p$-groups - Ayan Mahalanobis (CoRR, 2011)

The ElGamal cryptosystem over circulant matrices. - Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2011)

A New Guess-and-Determine Attack on the A5/1. - Jay Shah; Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2012)

The MOR cryptosystem and finite $p$-groups. - Ayan Mahalanobis (CoRR, 2013)

An Improved Guess-and-Determine Attack on the A5/1 Stream Cipher. - Ayan Mahalanobis; Jay Shah (Comput. Inf. Sci., 2014)

MOR Cryptosystem and classical Chevalley groups in odd characteristic. - Ayan Mahalanobis; Anupam Singh (CoRR, 2014)

The MOR Cryptosystem and Unitary group in odd characteristic. - Ayan Mahalanobis; Anupam Singh (CoRR, 2014)

On improvements of the $r$-adding walk in a finite field of characteristic 2. - Ansari Abdullah; Hardik Gajera; Ayan Mahalanobis (CoRR, 2016)

Bilinear Cryptography Using Groups of Nilpotency Class 2. - Ayan Mahalanobis; Pralhad Shinde (IMACC, 2017)

Bilinear cryptography using finite p-groups of nilpotency class 2. - Ayan Mahalanobis; Pralhad Shinde (CoRR, 2017)

A Probabilistic Baby-Step Giant-Step Algorithm. - Prabhat Kushwaha; Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2017)

A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes. - Upendra Kapshikar; Ayan Mahalanobis (ICETE (2), 2018)

A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem. - Ayan Mahalanobis; Vivek Mohan Mallick; Ansari Abdullah (INDOCRYPT, 2018)

A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. - Ayan Mahalanobis; Vivek Mallick (IACR Cryptol. ePrint Arch., 2018)

The Niederreiter cryptosystem and Quasi-Cyclic codes. - Upendra Kapshikar; Ayan Mahalanobis (IACR Cryptol. ePrint Arch., 2019)

Algorithms in Linear Algebraic Groups. - Sushil Bhunia; Ayan Mahalanobis; Pralhad Shinde; Anupam Singh (CoRR, 2020)

Initial minors - a conjecture to solve the elliptic curve discrete logarithm problem. - Ansari Abdullah; Ayan Mahalanobis; Vivek Mohan Mallick (CoRR, 2020)

A remark on MAKE - a Matrix Action Key Exchange. - Chris Monico; Ayan Mahalanobis (CoRR, 2020)

A McEliece cryptosystem using permutation codes. - Adarsh Srinivasan; Ayan Mahalanobis (CoRR, 2021)

Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling. - Upendra Kapshikar; Ayan Mahalanobis (Adv. Math. Commun., 2023)

Minors solve the elliptic curve discrete logarithm problem. - Ansari Abdullah; Ayan Mahalanobis (CoRR, 2023)

Symplectic Elimination. - Ayan Mahalanobis (CoRR, 2025)