Elliptic Curve Cryptography Considerations for Securing Automation and SCADA Systems. [PDF]
Tidrea A, Korodi A, Silea I.
europepmc +1 more source
Stopping time signatures for some algorithms in cryptography [PDF]
We consider the normalized distribution of the overall running times of some cryptographic algorithms, and what information they reveal about the algorithms.
Deift, Percy+2 more
core +1 more source
Comprehensive Review and Analysis of Cryptography Techniques in Cloud Computing
Cloud computing is a fast-growing industry that offers various online services, including software, computing resources, and databases. Its payment model is usage-based, whereas consistency is based on resource-sharing.
K. Sasikumar, Sivakumar Nagarajan
doaj +1 more source
Lightweight Authentication Mechanism for Industrial IoT Environment Combining Elliptic Curve Cryptography and Trusted Token. [PDF]
Yang YS+5 more
europepmc +1 more source
Use of Elliptic Curves in Cryptography [PDF]
We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p).
openaire +1 more source
Distortion maps for genus two curves [PDF]
Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g.
Galbraith, Steven D.+3 more
core +3 more sources
FPGA Implementation for Elliptic Curve Cryptography Algorithm and Circuit with High Efficiency and Low Delay for IoT Applications. [PDF]
Wang D, Lin Y, Hu J, Zhang C, Zhong Q.
europepmc +1 more source
Practical Three-Factor Authentication Protocol Based on Elliptic Curve Cryptography for Industrial Internet of Things. [PDF]
Zhao X, Li D, Li H.
europepmc +1 more source
Efficient unified Montgomery inversion with multibit shifting [PDF]
Computation of multiplicative inverses in finite fields GF(p) and GF(2/sup n/) is the most time-consuming operation in elliptic curve cryptography, especially when affine co-ordinates are used.
Gutub, Adnan Abdül-Aziz+3 more
core
A biometrics-based mutual authentication and key agreement protocol for TMIS using elliptic curve cryptography. [PDF]
Chen Y, Chen J.
europepmc +1 more source