8 citations · 32 across the 25 of their papers we have counts for
16 papers · 1 filter
A Guess and Determine Attack on the Elliptic Curve Discrete Logarithm Problem
Ayan Mahalanobis
This paper is a continuation of our earlier work, in which we described a Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The Las Vegas algorithm reduce…
Minors solve the elliptic curve discrete logarithm problem
Ansari Abdullah, Ayan Mahalanobis
The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in com…
A remark on MAKE -- a Matrix Action Key Exchange
Chris Monico, Ayan Mahalanobis
In a recent paper [arXiv:2009.00716], Rahman and Shpilrain proposed a new key-exchange protocol MAKE based on external semidirect product of groups. The purpose of this paper is to…
A new method for solving the elliptic curve discrete logarithm problem
Ansari Abdullah, Ayan Mahalanobis, Vivek M. Mallick
The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic cur…
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
Upendra Kapshikar, Ayan Mahalanobis
McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days becaus…
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes
Upendra Kapshikar, Ayan Mahalanobis
In this paper, we describe a new Niederreiter cryptosystem based on quasi-cyclic codes that is quantum-secure. This new cryptosystem has good transmission rate comp…