Results 11 to 20 of about 7,819 (154)
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Journal of Mathematical Cryptology, 2021 We generalize our earlier works on computing short discrete logarithms with tradeoffs, and bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's groundbreaking works on computing orders and general discrete logarithms.
Ekerå Martin
doaj +1 more source
Research on Quantum Annealing Integer Factorization Based on Different Columns
Frontiers in Physics, 2022 The majority of scholars believe that Shor’s algorithm is a unique and powerful quantum algorithm for RSA cryptanalysis, so current postquantum cryptography research has largely considered only the potential threats of Shor’s algorithm.
Baonan Wang, Xiaoting Yang, Dan Zhang
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
On Shor's r-Algorithm for Problems with Constraints
Кібернетика та комп'ютерні технології, 2023 Introduction. Nonsmooth optimization problems arise in a wide range of applications, including engineering, finance, and deep learning, where activation functions often have discontinuous derivatives, such as ReLU.
Vladimir Norkin, Anton Kozyriev
doaj +1 more source
Factoring semi-primes with (quantum) SAT-solvers
Scientific Reports, 2022 The computational difficulty of factoring large integers forms the basis of security for RSA public-key cryptography. The best-known factoring algorithms for classical computers run in sub-exponential time.
Michele Mosca, Sebastian R. Verschoor
doaj +1 more source
Use of the Shor’s r-Algorithm in Linear Robust Optimization Problems
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the description of a new approach to the construction of algorithms for solving linear programming problems (LP-problems), in which the number of constraints is much greater than the number of variables.
P. Stetsyuk +3 more
doaj +1 more source
Advanced Homomorphic Encryption for Cloud Data Security
JOIV: International Journal on Informatics Visualization, 2017 This paper aims to provide security of data in the Cloud using Multiplicative Homomorphic Approach. Encryption process is done with RSA algorithm. In this RSA algorithm, Shor’s algorithm is used for generating Public key Component, which enhances the ...
D. Chandravathi, P.V. Lakshmi
doaj +1 more source
Efficient magic state factories with a catalyzed $|CCZ\rangle$ to $2|T\rangle$ transformation [PDF]
Quantum, 2019 We present magic state factory constructions for producing $|CCZ\rangle$ states and $|T\rangle$ states. For the $|CCZ\rangle$ factory we apply the surface code lattice surgery construction techniques described in \cite{fowler2018} to the fault-tolerant ...
Craig Gidney, Austin G. Fowler
doaj +1 more source
Variational Quantum Algorithm for Solving Discrete Logarithms [PDF]
Jisuanji kexueThe discrete logarithm problem is a significant challenge in number theory,and due to the difficulty of solving it,classical computers lack efficient algorithms for this task.As a result,the discrete logarithm problem is widely used in public key ...
ZHANG Xinglan, RONG Xiaojun
doaj +1 more source
Non-Resonant Effects in Implementation of Quantum Shor Algorithm [PDF]
, 1999 We simulate Shor's algorithm on an Ising spin quantum computer. The influence of non-resonant effects is analyzed in detail. It is shown that our ``$2\pi k$''-method successfully suppresses non-resonant effects even for relatively large values of the ...
A. Ekert +9 more
core +2 more sources