Results 21 to 30 of about 12,362 (163)
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 solvable
A.J. Menezes +15 more
core +4 more sources
On the first fall degree of summation polynomials
Journal of Mathematical Cryptology, 2019 We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.
Kousidis Stavros, Wiemers Andreas
doaj +1 more source
Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
Journal of Mathematical Cryptology, 2014 We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group 𝐆$\mathbf {G}$. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the ...
Bos Joppe W. +2 more
doaj +1 more source
Cryptanalysis and improvement of an encryption scheme that uses elliptic curves over finite fields
Kuwait Journal of Science, 2021 In this paper, we cryptanalyzed a recently proposed encryption scheme that uses elliptic curve over a finite field. The security of proposed scheme depends upon elliptic curve discrete logarithm problem.
Malik Zia, Rashid Ali
doaj +1 more source
Journal of Telecommunications and Information TechnologyThis paper investigates how to reduce the elliptic curve discrete logarithm problem over prime fields to the quadratic unconstrained binary optimization (QUBO) problem in order to obtain as few logical qubits as possible. In the best case scenario, if n
Michał Wroński +3 more
doaj +1 more source
On the cryptographic properties of “Limonnik-3” AKE scheme
Безопасность информационных технологий, 2019 We study the “Limonnik-3” authenticated key exchange protocol which is a part of Standardization recommendations R 1323565.1.004-2017 “Authenticated key agreement schemes based on public keys”, officially adopted in Russia in 2017, alongside with the ...
Sergey V. Grebnev
doaj +1 more source
On the asymptotic effectiveness of Weil descent attacks
Journal of Mathematical Cryptology, 2010 In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields.
Karabina Koray +3 more
doaj +1 more source
Quantum resource estimates for computing elliptic curve discrete logarithms [PDF]
, 2017 We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition ...
A Joux +32 more
core +2 more sources
LAMAS: Lightweight anonymous mutual authentication scheme for securing fog computing environments
Ain Shams Engineering Journal, 2022 Fog computing uses near-user edge devices that are usually smart devices with very limited storage and computation resources; hence, the authentication process should be lightweight to be suitable for fog computing environment.
Mariam Hamada +2 more
doaj +1 more source
The Anatomical Record, EarlyView.Abstract The oval window (OW) is an opening connecting the inner and middle ear. Its area has been shown to consistently scale with body mass (BM) in primates, and has been used alongside semi‐circular canal (SCC) size to differentiate Homo sapiens and fossil hominins, including Paranthropus robustus.
Ruy Fernandez, José Braga
wiley +1 more source