Results 31 to 40 of about 6,909,513 (161)
The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences [PDF]
, 2008 . We define three hard problems in the theory of elliptic divisibility sequences (EDS Association, EDS Residue and EDS Discrete Log), each of which is solvable in sub-exponential time if and only if the elliptic curve discrete logarithm problem is ...
E. Stange +5 more
core +2 more sources
The Elliptic Curve Discrete Logarithm and Functional Graphs [PDF]
, 2011 The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve discrete logarithm problem (ECDLP) is an open problem in the field of number theory, and its applications to modern cryptographic algorithms are numerous ...
Evans, Christopher J
core +1 more source
Depth-Optimization of Quantum Cryptanalysis on Binary Elliptic Curves
IEEE Access, 2023 This paper presents quantum cryptanalysis for binary elliptic curves from a time-efficient implementation perspective (i.e., reducing the circuit depth), complementing the previous research that focuses on the space-efficiency perspective (i.e., reducing
Dedy Septono Catur Putranto +4 more
doaj +1 more source
Topological analysis of number theory and its applications in quantum cryptography [PDF]
مجلة جامعة الانبار للعلوم الصرفةThis study investigates the application of algebraic topology, in particular homology theory and persistent homology. It includes the analysis of elliptic curves and their use in cryptographic systems and cybersecurity.
Noor Kadhim, Ruaa Abd, Saja AL-Khafaji
doaj +1 more source
A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication
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 +1 more source
Intelligent and Converged NetworksThe computational hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP) directly determines Elliptic-Curve Cryptography (ECC) security. Quantum Annealing (QA) leverages its unique tunneling effects to effectively escape local optima.
Yu Lin +6 more
doaj +1 more source
IPChain: Blockchain-Based Security Protocol for IoT Address Management Servers in Smart Homes
Journal of Sensor and Actuator Networks, 2022 The dynamic host configuration protocol (DHCP) servers are forms of an Internet of Things (IoT) address management server (IoTAMS) that gives network configuration settings to newly connected hosts.
Bello Musa Yakubu +2 more
doaj +1 more source
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 +1 more source
Provably-Secure (Chinese Government) SM2 and Simplified SM2 Key Exchange Protocols
The Scientific World Journal, 2014 We revisit the SM2 protocol, which is widely used in Chinese commercial applications and by Chinese government agencies. Although it is by now standard practice for protocol designers to provide security proofs in widely accepted security models in order
Ang Yang +3 more
doaj +1 more source
Complexity bounds on Semaev’s naive index calculus method for ECDLP
Journal of Mathematical Cryptology, 2020 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 ...
Yokoyama Kazuhiro +3 more
doaj +1 more source