Cover Image

On completely factoring any integer efficiently in a single run of an order finding algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ekerå, Martin
Format:	Preprint
Published:	2020
Subjects:	Quantum Physics Cryptography and Security Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum algorithms for computing short discrete logarithms and factoring RSA integers
by: Ekerå, Martin, et al.
Published: (2017)

On the success probability of quantum order finding
by: Ekerå, Martin
Published: (2022)

Spanning-tree-packing protocol for conference key propagation in quantum networks
by: Trushechkin, Anton, et al.
Published: (2025)

Extending Regev's factoring algorithm to compute discrete logarithms
by: Ekerå, Martin, et al.
Published: (2023)

On the success probability of the quantum algorithm for the short DLP
by: Ekerå, Martin
Published: (2023)

Revisiting Shor's quantum algorithm for computing general discrete logarithms
by: Ekerå, Martin
Published: (2019)

Security issues of CFS-like digital signature algorithms
by: D'Alconzo, Giuseppe, et al.
Published: (2021)

A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography
by: Ekerå, Martin, et al.
Published: (2024)

Quantum Hilbert Transform
by: Jha, Nitin, et al.
Published: (2025)

Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers
by: Ayanzadeh, Ramin, et al.
Published: (2023)

Demystifying the RSA Algorithm: An Intuitive Introduction for Novices in Cybersecurity
by: Luo, Zhengping Jay, et al.
Published: (2023)

The Beginner's Textbook for Fully Homomorphic Encryption
by: Ko, Ronny
Published: (2025)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
by: Kudin, Sadmir, et al.
Published: (2024)

On the matching arrangement of a graph, improper weight function problem and its application
by: Bolotnikov, Aleksey, et al.
Published: (2024)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)

Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity and Reversibility
by: Ramdhane, Firas Ben, et al.
Published: (2025)

Combinatorial Designs and Cellular Automata: A Survey
by: Manzoni, Luca, et al.
Published: (2025)

Millions of inequivalent quadratic APN functions in eight variables
by: Beierle, Christof, et al.
Published: (2025)

Uniformity Testing under User-Level Local Privacy
by: Canonne, Clément L., et al.
Published: (2025)

Locally Private Histograms in All Privacy Regimes
by: Canonne, Clément L., et al.
Published: (2024)

Establishing a leader in a pairwise comparisons method
by: Szybowski, Jacek, et al.
Published: (2024)

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
by: Bangachev, Kiril, et al.
Published: (2024)

ORBITAAL: A Temporal Graph Dataset of Bitcoin Entity-Entity Transactions
by: Coquidé, Célestin, et al.
Published: (2024)

Factoring integers via Schnorr's algorithm assisted with VQE
by: Cano, Luis Sánchez, et al.
Published: (2024)

SHA-256 Collision Attack with Programmatic SAT
by: Alamgir, Nahiyan, et al.
Published: (2024)

New classes of reversible cellular automata
by: Haugland, Jan Kristian, et al.
Published: (2024)

SAT and Lattice Reduction for Integer Factorization
by: Ajani, Yameen, et al.
Published: (2024)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
by: Montanez-Barrera, Alejandro, et al.
Published: (2022)

PoW Security-Latency under Random Delays and the Effect of Transaction Fees
by: Doger, Mustafa, et al.
Published: (2024)

Transaction Capacity, Security and Latency in Blockchains
by: Doger, Mustafa, et al.
Published: (2024)

Refined Bitcoin Security-Latency Under Network Delay
by: Doger, Mustafa, et al.
Published: (2022)

Quantum algorithms for optimizers
by: Nannicini, Giacomo
Published: (2024)

Efficient unitary designs and pseudorandom unitaries from permutations
by: Chen, Chi-Fang, et al.
Published: (2024)

Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy
by: Klep, Igor, et al.
Published: (2025)

Multiparty Quantum Key Agreement: Architectures, State-of-the-art, and Open Problems
by: Mouaji, Malik, et al.
Published: (2026)

Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution
by: Grilo, Alex B., et al.
Published: (2025)

Quantitative quantum soundness for all multipartite compiled nonlocal games
by: Baroni, Matilde, et al.
Published: (2025)

A bound on the quantum value of all compiled nonlocal games
by: Kulpe, Alexander, et al.
Published: (2024)

Towards a complete classification of holographic entropy inequalities
by: Bao, Ning, et al.
Published: (2024)

An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
by: Doger, Mustafa, et al.
Published: (2025)