Results 1 to 10 of about 1,761 (191)
An ECDLP-Based Verifiable Multi-Secret Sharing Scheme [PDF]
Mathematics Interdisciplinary Research, 2020 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
A New ECDLP-Based PoW Model [PDF]
Mathematics, 2020 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
doaj +4 more sources
Complexity bounds on Semaev’s naive index calculus method for ECDLP [PDF]
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 +3 more sources
An Aggregate Signature Scheme Based on a Trapdoor Hash Function for the Internet of Things [PDF]
Sensors, 2019 With the rapid development of the Internet of Things (IoT), it becomes challenging to ensure its security. Identity authentication and integrity verification can be achieved by secure hash functions and digital signature algorithms for IoT applications ...
Hong Shu +5 more
doaj +2 more sources
Efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography. [PDF]
PLoS ONEIn 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
Evaluation of Computational Approaches of Short Weierstrass Elliptic Curves for Cryptography
Cybernetics and Information Technologies, 2021 The survey presents the evolution of Short Weierstrass elliptic curves after their introduction in cryptography. Subsequently, this evolution resulted in the establishment of present elliptic curve computational standards.
Abhishek Kunal +1 more
doaj +1 more source
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
Barekeng, 2022 El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was but later it was proven that using the
Sa'aadah Sajjana Carita, Herman Kabetta
doaj +1 more source
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
Cybersecurity, 2023 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 +1 more source
Computation of Trusted Short Weierstrass Elliptic Curves for Cryptography
Cybernetics and Information Technologies, 2021 Short Weierstrass elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problem (ECDLP) are widely used in cryptographic applications. A notion of security called Elliptic Curve Cryptography (ECC) security is also suggested in literature
Abhishek Kunal +1 more
doaj +1 more source
Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation?
Journal of Mathematical Cryptology, 2020 We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field 𝔽p2. Using the representation technique, we reduce ECDLP to a multivariate polynomial zero testing problem.
Delaplace Claire, May Alexander
doaj +1 more source