Results 1 to 10 of about 171 (88)
Speed improvement of the quantum factorization algorithm of P. Shor by upgrade its classical part [PDF]
E3S Web of Conferences, 2020 This report discusses Shor’s quantum factorization algorithm and ρ–Pollard’s factorization algorithm. Shor’s quantum factorization algorithm consists of classical and quantum parts.
Cherckesova Larissa +5 more
doaj +1 more source
Shor's Factoring Algorithm and Modular Exponentiation Operators
Quanta, 2023 We provide a pedagogical presentation of Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time.
Robert L. Singleton Jr
doaj +1 more source
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
Mathematics, 2023 Shor’s factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today’s quantum computers only permit a study of Shor’s algorithm for very small numbers.
Dennis Willsch +4 more
doaj +1 more source
AppliedMath, 2022 Shor’s algorithm for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis.
Johanna Barzen, Frank Leymann
doaj +1 more source
Optimising Matrix Product State Simulations of Shor's Algorithm [PDF]
Quantum, 2019 We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure of a matrix ...
Aidan Dang +2 more
doaj +1 more source
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