Ayan Mahalanobis

44 papers C 2Misc 1Journal 40Unranked 1

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