Results 1 to 10 of about 298 (166)
A New ECDLP-Based PoW Model [PDF]
Blockchain technology has attracted a lot of research interest in the last few years. Originally, their consensus algorithm was Hashcash, which is an instance of the so-called Proof-of-Work. Nowadays, there are several competing consensus algorithms, not
Alessio Meneghetti +2 more
exaly +6 more sources
Complexity bounds on Semaev’s naive index calculus method for ECDLP [PDF]
Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as ...
Masaya Yasuda, Kazuhiro Yokoyama
exaly +4 more sources
A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication [PDF]
Elliptic curve cryptography (ECC) has become a popular public key cryptography standard. The security of ECC is due to the difficulty of solving the elliptic curve discrete logarithm problem (ECDLP).
Lyndon Judge +2 more
doaj +3 more sources
Analysis of the Fault Attack ECDLP over Prime Field [PDF]
In 2000, Biehl et al. 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 𝔽p with base point P∈E(𝔽p).
Mingqiang Wang, Tao Zhan
doaj +4 more sources
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
The elliptic curve discrete logarithm problem (ECDLP) is a popular choice for cryptosystems due to its high level of security. However, with the advent of the extended Shor’s algorithm, there is concern that ECDLP may soon be vulnerable.
Xia Liu, Huan Yang, Li Yang
doaj +3 more sources
An ECDLP-Based Verifiable Multi-Secret Sharing Scheme [PDF]
Secret sharing is an important issue in cryptography which has many applications. In a secret sharing scheme, a secret is shared by a dealer among several participants in such a way that any authorized subset of participants can recover the secret ...
Khadijeh Eslami, Mojtaba Bahramian
doaj +2 more sources
Solving 114-Bit ECDLP for a Barreto-Naehrig Curve [PDF]
The security of cryptographic protocols which are based on elliptic curve cryptography relies on the intractability of elliptic curve discrete logarithm problem (ECDLP). In this paper, the authors describe techniques applied to solve 114-bit ECDLP in Barreto-Naehrig (BN) curve defined over the odd characteristic field.
Yasuyuki Nogami +2 more
exaly +2 more sources
Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP [PDF]
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. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic ...
Michiel Kosters
exaly +3 more sources
Efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography. [PDF]
In an attribute-based strong designated verifier signature, a signer who satisfies the access structure signs the message and assigns it to a verifier who satisfies the access structure to verify it, which enables fine-grained access control for signers ...
Rui Ma, Linyue Du
doaj +2 more sources
Shor’s Quantum Algorithm for Solving the Binary ECDLP: A Survey
Abstract Shor’s quantum algorithm can solve the factorization problem and the elliptic curve discrete logarithm problem (ECDLP) in polynomial time. Due to the physical barrier for realizing large-scale reliable quantum computer, designs of concrete quantum circuits and their resource estimates have been actively ...
Atsushi Takayasu +2 more
exaly +2 more sources

