Results 41 to 50 of about 6,909,513 (161)
Depth Optimization of FLT-Based Quantum Inversion Circuit
Works on quantum computing and cryptanalysis have increased significantly in the past few years. Various constructions of quantum arithmetic circuits as one of the primary elements in the field have also been proposed. However, there have only been a few
Harashta Tatimma Larasati +4 more
doaj +1 more source
Minors solve the elliptic curve discrete logarithm problem [PDF]
The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in computational mathematics.
Abdullah, Ansari, Mahalanobis, Ayan
core +1 more source
Proxy Blind Signature Scheme based on Discrete Logarithm Problem and Elliptic Curve Discrete Logarithm Problem [PDF]
In some applications, it is necessary to protect the privacy of the content of user from signer. Proxy blind signature can be used in these applications which combine the properties of both proxy signature and blind signature.
Aung Nway Oo, Ni Lar Thein
core +1 more source
Comparison between the RSA cryptosystem and elliptic curve cryptography [PDF]
In the globalization era, cryptography becomes more popular and powerful; in fact it is very important in many areas (i.e. mathematics, computer science, networks, etc).
Abdullah, Kamilah
core
This paper presents a lightweight mutual authentication protocol for VANETs that integrates SDN, edge computing, and ECC to achieve low‐latency, scalable, and privacy‐preserving vehicle communication. The proposed system reduces authentication delay and computational overhead while supporting batch verification and conditional identity traceability ...
Adi El‐Dalahmeh, Layla Albdour
wiley +1 more source
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 +1 more source
Recent proposals by Mahmood et al., Braeken et al., and Chaudhry et al. aimed at establishing secure communication in AMI, asserting their methods fulfil the requisite security criteria. This paper, however, reveals that each of these proposals exhibits security vulnerabilities and lacks sufficient features for deployment.
Ahmad Rahdari, Bahareh Akhbari
wiley +1 more source
Cryptanalysis of the dual elliptic curve pseudorandom generator [PDF]
The Dual Elliptic Curve Pseudorandom Generator (DEC PRG) is proposed by Barker and Kelsey in a draft NIST Special Publication. It is claimed that the pseudorandom generator is secure unless the adversary can solve the elliptic curve discrete logarithm ...
Berry Schoenmakers +4 more
core +1 more source
Starting from the basic form of GN-authenticated key agreement (GN-AK), the current research proposes an improved protocol by integrating a new scalar multiplication technique based on a dual-base chain representation with bases 1/2 and 3.
Nicolae Constantinescu +2 more
doaj +1 more source
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Essentially all subexponential time algorithms for the discrete logarithm problem over finite fields are based on the index calculus idea. In proposing cryptosystems based on the elliptic curve discrete logarithm problem (ECDLP) Miller [6] also gave ...
Ka Lam Kueh +2 more
core +1 more source

