Results 71 to 80 of about 298 (166)
We demonstrate genuine quantum cryptanalysis of the Elliptic Curve Discrete Logarithm Problem up to 14 bits on IBM's 156-qubit Heron R2 processor. Unlike planted-key demonstrations, our implementation uses a full group operation oracle that recovers private keys without prior knowledge.
openaire +1 more source
Solving 94-Bit Ecdlp With 70 Computers In Parallel
Elliptic curve discrete logarithm problem(ECDLP) is one of problems on which the security of pairing-based cryptography is based. This paper considers Pollard's rho method to evaluate the security of ECDLP on Barreto-Naehrig(BN) curve that is an efficient pairing-friendly curve. Some techniques are proposed to make the rho method efficient. Especially,
Miyoshi, Shunsuke +3 more
openaire +2 more sources
Choosing Coordinate Forms for Solving ECDLP Using Shor's Algorithm
The primary concerns lie in the limited significance and novelty. While the paper explores the use of projective coordinates, quantum resource requirements are worse than those achieved with previously studied affine coordinates, as carefully documented in the ...
Huang, Yan +4 more
openaire +2 more sources
Vehicle-Infrastructure Cooperative Systems (VICS) are widely used in the safe driving and management of operating vehicles (OV). To preserve privacy and resist harmful attacks, digital certificates and signatures are used during vehicle communication ...
Jiasheng Yuan +3 more
doaj +1 more source
Atomic cross-chain swap based on private key exchange
Atomic Cross-Chain Swap (ACCS) is one important topic in cryptocurrency, where users can securely and trustlessly exchange assets between two different blockchains.
Zeshuo Zhu, Rui Zhang, Yang Tao
doaj +1 more source
The generalized method of solving ECDLP using quantum annealing
This paper presents a generalization of a method allowing the transformation of the Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem. The original method requires that a given elliptic curve model has complete arithmetic. The new one has no such restriction, which is a
openaire +2 more sources
Brace for impact: ECDLP challenges for quantum cryptanalysis
Precise suites of benchmarks are required to assess the progress of early fault-tolerant quantum computers at economically impactful applications such as cryptanalysis. Appropriate challenges exist for factoring but those for elliptic curve cryptography are either too sparse or inadequate for standard applications of Shor's algorithm.
Dallaire-Demers, Pierre-Luc +2 more
openaire +2 more sources
Traditional voting systems mainly comprise of paper polling, electronic ballot system (EVM), mechanical devices, etc., and demand the physical presence of the voters.
Suman Majumder +5 more
doaj +1 more source
Radio Frequency Identification (RFID) promotes the fundamental tracking procedure of the Internet of Things (IoT) network due to its autonomous data collection as well as transfer incurring low costs.
Suman Majumder +5 more
doaj +1 more source
ECDLP Layered Hardness Decomposition — code, datasets, and verification ...
zhuang, jiongwen, Chen, Chen
openaire +1 more source

