Results 21 to 30 of about 6,909,811 (176)
A secure and efficient certificateless content extraction signature with privacy protection.
PLoS ONE, 2021 Efficiency and privacy are the key aspects in content extraction signatures. In this study, we proposed a Secure and Efficient and Certificateless Content Extraction Signature with Privacy Protection (SECCESPP) in which scalar multiplication of elliptic ...
Can Zhao +4 more
doaj +2 more sources
Elliptic divisibility sequences and the elliptic curve discrete logarithm problem [PDF]
, 2008 We use properties of the division polynomials of an elliptic curve $E$ over a finite field $\mathbb{F}_q$ together with a pure result about elliptic divisibility sequences from the 1940s to construct a very simple alternative to the Menezes-Okamoto ...
Rachel Shipsey, Christine Swart
core +1 more source
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
Attribute-Based Blind Signature Scheme Based on Elliptic Curve Cryptography
IEEE Access, 2022 Blind signature is a special digital signature that allows the signer to sign a document without knowing its content. However, in many situations, multiple people need to blindly sign messages.
Rui Ma, Linyue Du
doaj +1 more source
Elliptic Curve Cryptosystem on the Base of Discrete Logarithm Generator [PDF]
, 1998 In this paper, we showed the theory of elliptic curve, discrete logarithm problem (DLD), elliptic curve discrete logarithm problem (EDLP), discrete logarithm generator and EIGamal cryptosystem and elliptic cryptosystem.
ODAKA, Tomohiro +7 more
core +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
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
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