8 citations · 32 across the 25 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.CR2017
Bilinear cryptography using finite -groups of nilpotency class 2
Ayan Mahalanobis, Pralhad Shinde
In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finit…
cs.CR2017
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
Ayan Mahalanobis, Vivek Mallick
In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of…
cs.CR2017★ 2 cited
A Probabilistic Baby-Step Giant-Step Algorithm
Prabhat Kushwaha, Ayan Mahalanobis
In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order o…