Ayan Mahalanobis

Orcid: 0000-0001-9822-3672

Affiliations:
  • Indian Institute of Science Education Research Pune, India
  • Florida Atlantic University, Boca Raton, FL, USA (PhD 2005)


According to our database1, Ayan Mahalanobis authored at least 31 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Minors solve the elliptic curve discrete logarithm problem.
CoRR, 2023

Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling.
Adv. Math. Commun., 2023

2021
A McEliece cryptosystem using permutation codes.
CoRR, 2021

2020
A remark on MAKE - a Matrix Action Key Exchange.
CoRR, 2020

Initial minors - a conjecture to solve the elliptic curve discrete logarithm problem.
CoRR, 2020

Algorithms in Linear Algebraic Groups.
CoRR, 2020

2019
The Niederreiter cryptosystem and Quasi-Cyclic codes.
IACR Cryptol. ePrint Arch., 2019

2018
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2018

A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes.
Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, 2018

2017
A Probabilistic Baby-Step Giant-Step Algorithm.
IACR Cryptol. ePrint Arch., 2017

Bilinear cryptography using finite p-groups of nilpotency class 2.
CoRR, 2017

Bilinear Cryptography Using Groups of Nilpotency Class 2.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

2016
On improvements of the $r$-adding walk in a finite field of characteristic 2.
CoRR, 2016

2014
The MOR Cryptosystem and Unitary group in odd characteristic.
CoRR, 2014

MOR Cryptosystem and classical Chevalley groups in odd characteristic.
CoRR, 2014

An Improved Guess-and-Determine Attack on the A5/1 Stream Cipher.
Comput. Inf. Sci., 2014

2013
The MOR cryptosystem and finite $p$-groups.
CoRR, 2013

2012
A New Guess-and-Determine Attack on the A5/1.
IACR Cryptol. ePrint Arch., 2012

2011
The ElGamal cryptosystem over circulant matrices.
IACR Cryptol. ePrint Arch., 2011

The MOR cryptosystem and extra-special $p$-groups
CoRR, 2011

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

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

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

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

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

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

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

2001
Bounded Variation Implies Regulated: A Constructive Proof.
J. Symb. Log., 2001

Increasing, Nondecreasing, and Virtually Continuous Functions.
J. Autom. Lang. Comb., 2001

2000
Sequential Continuity of Functions in Constructive Analysis.
Math. Log. Q., 2000


  Loading...