Ayan Mahalanobis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2023

Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier samplingUpendra Kapshikar, Ayan Mahalanobis. amco, 17(6):1476-1492, 2023. [doi]

2019

The Niederreiter cryptosystem and Quasi-Cyclic codesUpendra Kapshikar, Ayan Mahalanobis. iacr, 2019:1272, 2019. [doi]

2018

A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic CodesUpendra Kapshikar, Ayan Mahalanobis. icete 2018: 506-513

A Las Vegas algorithm to solve the elliptic curve discrete logarithm problemAyan Mahalanobis, Vivek Mallick. iacr, 2018:134, 2018. [doi]

A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm ProblemAyan Mahalanobis, Vivek Mohan Mallick, Ansari Abdullah. indocrypt 2018: 215-227 [doi]

2017

A Probabilistic Baby-Step Giant-Step AlgorithmPrabhat Kushwaha, Ayan Mahalanobis. iacr, 2017:55, 2017. [doi]

A Probabilistic Baby-step Giant-step AlgorithmPrabhat Kushwaha, Ayan Mahalanobis. secrypt 2017: 401-406

Bilinear Cryptography Using Groups of Nilpotency Class 2Ayan Mahalanobis, Pralhad Shinde. ima 2017: 127-134 [doi]

2014

An Improved Guess-and-Determine Attack on the A5/1 Stream CipherAyan Mahalanobis, Jay Shah. ccsecis, 7(1):115-124, 2014. [doi]

2012

A New Guess-and-Determine Attack on the A5/1Jay Shah, Ayan Mahalanobis. iacr, 2012:208, 2012. [doi]

2011

The ElGamal cryptosystem over circulant matricesAyan Mahalanobis. iacr, 2011:572, 2011. [doi]

2010

The discrete logarithm problem in the group of non-singular circulant matricesAyan Mahalanobis. gcc, 2(1):83-89, 2010. [doi]

2009

The discrete logarithm problem in the group of non-singular circulant matricesAyan Mahalanobis. iacr, 2009:190, 2009. [doi]

2008

A simple generalization of the {E}l{G}amal cryptosystem to non-abelian groups IIAyan Mahalanobis. iacr, 2008:11, 2008. [doi]

2006

A simple generalization of El-Gamal cryptosystem to non-abelian groupsAyan Mahalanobis. iacr, 2006:233, 2006. [doi]

2005

Diffie-Hellman key exchange protocol and non-abelian nilpotent groupsAyan Mahalanobis. iacr, 2005:110, 2005. [doi]

Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent GroupsAyan Mahalanobis. iacr, 2005:223, 2005. [doi]

2001

Bounded Variation Implies Regulated: A Constructive ProofDouglas S. Bridges, Ayan Mahalanobis. JSYML, 66(4):1695-1700, 2001.

Increasing, Nondecreasing, and Virtually Continuous FunctionsDouglas S. Bridges, Ayan Mahalanobis. jalc, 6(2):139-144, 2001.

2000

Sequential Continuity of Functions in Constructive AnalysisDouglas S. Bridges, Ayan Mahalanobis. mlq, 46(1):139-143, 2000. [doi]

Sign in or sign up to see more results.

runs on WebDSL