搜索结果: 1-13 共查到“军事学 ECDLP”相关记录13条 . 查询时间(0.097 秒)
Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations?
ECDLP Square Root Bound
2019/7/15
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field Fp2Fp2. Using the representation technique, we reduce ECDLP to a multivariate polynomial ...
We provide a new approach to the elliptic curve discrete logarithm problem (ECDLP). First, we construct Elliptic Codes (EC codes) from the ECDLP. Then we propose an algorithm of finding the minimum we...
On the Feasibility of an ECDLP Algorithm
elliptic curves discrete logarithm problem multiplicative orders
2018/5/3
We study the properties of an algorithm for solving the elliptic curve discrete logarithm problem presented by A.~Yu.~Nesterenko at the CTCrypt 2015 session. We show that for practically important ins...
A few more index calculus algorithms for the ECDLP
discrete logarithm problem elliptic curve cryptosystem
2018/1/2
The introduction of summation polynomials for elliptic curves by Semaev has opened up new avenues of investigation in index calculus type algorithms for the elliptic curve discrete logarithm problem, ...
Last fall degree, HFE, and Weil descent attacks on ECDLP
ECDLP Weil descent solving equations
2015/12/29
Weil descent methods have recently been applied to attack
the Hidden Field Equation (HFE) public key systems and solve the elliptic
curve discrete logarithm problem (ECDLP) in small characteristic.
...
Complexity of ECDLP under the First Fall Degree Assumption
ECDLP First fall degree assumption polynomial time algorithm
2015/12/22
Semaev [14] shows that under the first fall degree assumption, the complexity
of ECDLP over F2n , where n is the input size, is O(2n
1/2+o(1) ). In his manuscript,
the cost for solving equations sy...
The Fault Attack ECDLP Revisited
foundations
2012/3/28
Biehl et al.\cite{BMM} proposed a fault-based attack on elliptic curve cryptography. In this paper, we refined the fault attack method. An elliptic curve $E$ is defined over prime field $\mathbb{F}_p$...
The Fault Attack ECDLP Revisited
Discrete logarithm Subexponential Smooth integer Kroneck class number
2011/6/9
Biehl et al.\cite{BMM} proposed a fault-based attack on elliptic curve cryptography. In this paper, we refined the fault attack method. An elliptic curve $E$ is defined over prime field $\mathbb{F}_p$...
Elliptic curve discrete logarithm problem (ECDLP) is one of the most important hard problems that modern cryptography, especially public key cryptography, relies on. And many efforts are dedicate to s...
An Efficient Two-Party Identity-Based Key Exchange Protocol based on ECDLP
authentication identity-based key exchange
2009/9/27
This paper presents an efficient identity-based key exchange protocol
based on the difficulty of computing a Elliptic Curve Discrete Logarithm
Problem. As compared with the previously proposed proto...
An Efficient Two-Party Identity-Based Key Exchange Protocol based on ECDLP
authentication identity-based key exchange
2009/9/22
This paper presents an efficient identity-based key exchange protocol
based on the difficulty of computing a Elliptic Curve Discrete Logarithm
Problem. As compared with the previously proposed proto...
An Efficient Password Security of Three-Party Key Exchange Protocol based on ECDLP
Key exchange protocol Password based secure communication
2009/7/14
In this paper we have proposed an efficient password security of Three-
Party Key Exchange Protocol based on Elliptic Curve Discrete Logarithm
Problem. Key exchange protocols allow two parties commu...
PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP
PRIME POINTS ELLIPTIC CURVES ECDLP
2008/9/10
PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP.