Results 141 to 150 of about 701 (185)

A Conditional Privacy-Preserving Identity-Authentication Scheme for Federated Learning in the Internet of Vehicles. [PDF]

Entropy (Basel)
Xu S, Liu R.
europepmc   +1 more source

ASAP-IIOT: An Anonymous Secure Authentication Protocol for Industrial Internet of Things. [PDF]

Sensors (Basel)
Li N, Ma M, Wang H.
europepmc   +1 more source

An efficient signature aggregation scheme with antenna hardware implementation for VANETs. [PDF]

Sci Rep
Priyadharshini A, Rajasekaran AS, Kola KS, Balakrishnan A, Pattanayak RM.   +4 more
europepmc   +1 more source

Research on key technologies for privacy-preserving, regulatorily compliant, and cross-chain interoperability in heterogeneous blockchain systems. [PDF]

Sci Rep
Chen Z, Liu H, Zhang L, Dai B, Shi Y.
europepmc   +1 more source

EADC: An Efficient Anonymous Data Collection Scheme with Blockchain in Internet of Things. [PDF]

Sensors (Basel)
Si Z, Wang J, Zhao P, Wang X, Song J.
europepmc   +1 more source

Lightweight and Efficient Authentication and Key Distribution Scheme for Cloud-Assisted IoT for Telemedicine. [PDF]

Sensors (Basel)
Lee HJ, Kook S, Kim K, Ryu J, Lee H, Lee Y, Won D.   +6 more
europepmc   +1 more source

Solving 114-Bit ECDLP for a Barreto-Naehrig Curve [PDF]

Lecture Notes in Computer Science, 2018
The security of cryptographic protocols which are based on elliptic curve cryptography relies on the intractability of elliptic curve discrete logarithm problem (ECDLP). In this paper, the authors describe techniques applied to solve 114-bit ECDLP in Barreto-Naehrig (BN) curve defined over the odd characteristic field.
Yasuyuki Nogami, Md. Al-Amin Khandaker, Sylvain Duquesne   +2 more
exaly   +3 more sources

Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP [PDF]

Lecture Notes in Computer Science, 2015
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic ...
Michiel Kosters
exaly   +7 more sources

Some of the next articles are maybe not open access.

Related searches:

Development of Solving the ECDLP

2021 7th International Engineering Conference “Research & Innovation amid Global Pandemic" (IEC), 2021
The study and analysis of the Elliptic curve Discrete Logarithm Problem (ECDLP) is very important, because one of the strongest cryptosystems is based on this problem, which is elliptic curve cryptosystem. This aspect has led to make a clear change in cryptography and open new research field for treatment with special group that is the group of ...
Sattar B. Sadkhan
exaly   +2 more sources