Results 11 to 20 of about 701 (185)
A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication [PDF]
International Journal of Reconfigurable Computing, 2012 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 +6 more sources
The generalized method of solving ECDLP using quantum annealing [PDF]
International Journal of Electronics and TelecommunicationsThis paper presents a generalization of a method allowing the transformation of the Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem. The original method requires that a given elliptic curve model has complete arithmetic. The new one has no such restriction, which is a
Dzierzkowski, Łukasz
core +8 more sources
Improvement of FPPR method to solve ECDLP [PDF]
Pacific Journal of Mathematics for Industry, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, Yun-Ju +3 more
openaire +2 more sources
IACR Cryptol. ePrint Arch., 2011 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 solve this problem.
Lei Xu 0012, Dongdai Lin, Jing Zou
core +3 more sources
Analysis of the Fault Attack ECDLP over Prime Field [PDF]
Journal of Applied Mathematics, 2011 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 +5 more sources
Improvement of Faugère et al.’s Method to Solve ECDLP [PDF]
, 2013 Solving the elliptic curve discrete logarithm problem (ECDLP) by using Gr¨obner basis has recently appeared as a new threat to the security of elliptic curve cryptography and pairing-based cryptosystems. At Eurocrypt 2012, Faug`ere, Perret, Petit and Renault proposed a new method using a multivariable polynomial system to solve ECDLP over finite fields
Yun-Ju Huang +3 more
core +4 more sources
Solving 94-Bit Ecdlp With 70 Computers In Parallel
, 2015 Elliptic curve discrete logarithm problem(ECDLP) is one of problems on which the security of pairing-based cryptography is based. This paper considers Pollard's rho method to evaluate the security of ECDLP on Barreto-Naehrig(BN) curve that is an efficient pairing-friendly curve. Some techniques are proposed to make the rho method efficient. Especially,
Miyoshi, Shunsuke +3 more
openaire +3 more sources
Authenticated Encryption Scheme Based on ECDLP and DLP [PDF]
Applied Mathematics & Information Sciences, 2020 This paper presents a new authenticated encryption scheme (AES) based on elliptic curve discrete logarithm problem (ECDLP) and discrete logarithm problem (DLP).
Tahat, Nedal +4 more
openaire +2 more sources
New Blind Muti-signature Schemes based on ECDLP [PDF]
International Journal of Electrical and Computer Engineering (IJECE), 2018 In various types of electronic transactions, including election systems and digital cash schemes, user anonymity and authentication are always required. Blind signatures are considered the most important solutions to meeting these requirements. Many studies have focused on blind signature schemes; however, most of the studied schemes are single blind ...
Duc Nguyen Tan +4 more
openaire +4 more sources
Accelerating Baby-step Giant-step Algorithm for Solving ECDLP Using Elliptic Divisibility Sequences
Transactions on Cryptographic Hardware and Embedded SystemsThe elliptic curve discrete logarithm problem (ECDLP) is the foundation of the security of elliptic curve cryptography. The baby-step giant-step (BSGS) method is a generic deterministic algorithm, based on a space-time tradeoff, to solve the discrete ...
Ziwen Liao, Fangguo Zhang
doaj +2 more sources