搜索结果: 1-5 共查到“密码学 DLP”相关记录5条 . 查询时间(0.078 秒)
In this short note we give a polynomial-time quantum reduction from the vectorization problem (DLP) to the parallelization problem (CDHP) for group actions. Combined with the trivial reduction from pa...
We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (SGDLP) to the same problem in a subgroup of the same semigroup. It follows that SGD...
Solving a $6120$-bit DLP on a Desktop Computer
Discrete logarithm problem binary finite fields
2014/3/12
In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extre...
Secret Key Leakage from Public Key Perturbation of DLP-based Cryptosystems
DSA exponentiation fault injection public modulus lattice reduction
2010/11/22
Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of flaws in designs. Even elements, such as public keys, that do not seem critical must ...
The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications,
DHP-DLP equivalence Elliptic Curve Cryptosystems
2009/3/3
The theoretical equivalence between the DLP and DHP problems
was shown by Maurer in 1994. His work was then reexamined by
Muzereau et al. [11] for the special case of elliptic curves used in practic...