Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Kushwaha Prabhat"'
Autor:
Kushwaha Prabhat
Publikováno v:
Journal of Mathematical Cryptology, Vol 12, Iss 2, Pp 101-118 (2018)
In 2004, Muzereau, Smart and Vercauteren [A. Muzereau, N. P. Smart and F. Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math. 7 2004, 50–72] showed how to use a reduction alg
Externí odkaz:
https://doaj.org/article/583f6b6989354bc580f3e3f653b085f6
Autor:
Murli, Sathvik, Nandakumar, Dhruv, Kushwaha, Prabhat Kumar, Wang, Cheng, Redino, Christopher, Rahman, Abdul, Israni, Shalini, Singh, Tarun, Bowen, Edward
We present a novel approach to identify ransomware campaigns derived from attack timelines representations within victim networks. Malicious activity profiles developed from multiple alert sources support the construction of alert graphs. This approa
Externí odkaz:
http://arxiv.org/abs/2309.00700
Publikováno v:
Journal of Cryptographic Engineering 2020
We describe a novel type of weak cryptographic private key that can exist in any discrete logarithm based public-key cryptosystem set in a group of prime order $p$ where $p-1$ has small divisors. Unlike the weak private keys based on \textit{numerica
Externí odkaz:
http://arxiv.org/abs/2011.07483
Autor:
Kushwaha, Prabhat, Mahalanobis, Ayan
Publikováno v:
SECRYPT 2017
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 of the discrete logarithm in the multiplicative group of a finite field
Externí odkaz:
http://arxiv.org/abs/1701.07172
Autor:
Kushwaha, Prabhat
Publikováno v:
Journal of Mathematical Cryptology 2018
In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for various ell
Externí odkaz:
http://arxiv.org/abs/1610.01354
We describe a novel type of weak cryptographic private key that can exist in any discrete logarithm based public-key cryptosystem set in a group of prime order $p$ where $p-1$ has small divisors. Unlike the weak private keys based on \textit{numerica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94dd4eed0732e24383a83a9f488a780b
Publikováno v:
Journal of Cryptographic Engineering; Jun2021, Vol. 11 Issue 2, p181-195, 15p