Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
From MaRDI portal
Publication:4255836
DOI10.1137/S0036144598347011zbMath1005.11507WikidataQ56078694 ScholiaQ56078694MaRDI QIDQ4255836
Publication date: 27 June 1999
Published in: SIAM Review (Search for Journal in Brave)
Church's thesisFourier transformsquantum computersspin systemsfoundations of quantum mechanicsprime factorizationdiscrete logarithmsalgorithmic number theory
Related Items
Assessing security of cryptocurrencies with attack-defense trees: proof of concept and future directions, Post-quantum secure inner product functional encryption using multivariate public key cryptography, The security analysis and improvement of some novel quantum proxy signature schemes, Graph isomorphism and Gaussian boson sampling, Quantum theory is an information theory. The operational framework and the axioms, On the role of prior probability in adiabatic quantum algorithms, Quantum digital signature with continuous-variable, Inverting square systems algebraically is exponential, Progress in quantum algorithms, Layering quantum-resistance into classical digital signature algorithms, Controlled quantum secure direct communication with authentication based on quantum search algorithm, Verification of quantum computation and the price of trust, Using low-density parity-check codes to improve the McEliece cryptosystem, Optimizing quantum models of classical channels: the reverse Holevo problem, Toward non-interactive zero-knowledge proofs for NP from LWE, Bell's inequalities for three-qubit entangled states with white noise, Quantum-based feature selection for multiclassification problem in complex systems with edge computing, Cohering power of quantum operations, Small leaks sink a great ship: an evaluation of key reuse resilience of PQC third round finalist NTRU-HRSS, Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants, Quantum secret sharing based on quantum search algorithm, Quantum algorithms for typical hard problems: a perspective of cryptanalysis, Least-squares solutions to polynomial systems of equations with quantum annealing, Quantum digital signature in a network, Quantum \((t, n)\) threshold group signature based on Bell state, Tangible reduction in learning sample complexity with large classical samples and small quantum system, Splitting quaternion algebras over quadratic number fields, Revisiting lower dimension lattice attacks on NTRU, Fault-tolerant quantum error correction code preparation in UBQC, Quantum blind signature scheme based on quantum walk, A signature scheme on \(p^2\)-dimensional quantum system, Quantum public-key cryptosystem, Quantum programming with inductive datatypes: causality and affine type theory, Towards implementation of a generalized architecture for high-level quantum programming language, An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice, A verifiable threshold secret sharing scheme based on lattices, Multiparty controlled quantum secure direct communication based on quantum search algorithm, Multiple network alignment on quantum computers, Shortcuts to adiabatic for implementing controlled phase gate with Cooper-pair box qubits in circuit quantum electrodynamics system, Efficiently embedding QUBO problems on adiabatic quantum computers, Quantum attacks on sum of Even-Mansour pseudorandom functions, Optimization of one-way quantum computation measurement patterns, An arbitrated proxy blind signature based on hyper entanglement analysis, Efficient quantum algorithm for similarity measures for molecules, A new quantum proxy signature model based on a series of genuine entangled states, Practical security of RSA against NTC-architecture quantum computing attacks, T-count optimized Wallace tree integer multiplier for quantum computing, Finite-data-size study on practical universal blind quantum computation, A generalized circuit for the Hamiltonian dynamics through the truncated series, A high capacity quantum weak blind signature based on logistic chaotic maps, Quantum Relief algorithm, Quantum circuit oracles for abstract machine computations, Optimal processing of reversible quantum channels, Composable security against collective attacks of a modified BB84 QKD protocol with information only in one basis, Massively parallel quantum computer simulator, Quantum algorithm to find invariant linear structure of \(MD\) hash functions, Implementation of Grover's search algorithm in the QED circuit for two superconducting qubits, The singularity attack to the multivariate signature scheme HIMQ-3, Quantum computing algorithm for electromagnetic field simulation, Clifford gates in the Holant framework, Quantum multi-valued Byzantine agreement based on d-dimensional entangled states, Identity based blind signature scheme over NTRU lattices, Minimum \(k\)-critical bipartite graphs, Vibration analysis of cyclic symmetrical systems by quantum algorithms, On the circuit model of global adiabatic search algorithm, An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems, Threshold schemes from isogeny assumptions, Compact, efficient and UC-secure isogeny-based oblivious transfer, The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes, Quantum-resistant identity-based signature with message recovery and proxy delegation, Verification of quantum computation: an overview of existing approaches, Towards quantum computing based community detection, Chosen-ciphertext lattice-based public key encryption with equality test in standard model, Quantum blind signature scheme with cluster states based on quantum walk cryptosystem, Quantum mechanics, interference, and the brain, Quantum implicit computational complexity, Tightly secure signature schemes from the LWE and subset sum assumptions, QPCF: higher-order languages and quantum circuits, MPF problem over modified medial semigroup is NP-complete, An efficient semi-quantum private comparison without pre-shared keys, Arbitrated quantum signature scheme with quantum walk-based teleportation, Quantum algorithms for learning Walsh spectra of multi-output Boolean functions, Quantum cryptographic property testing of multi-output Boolean functions, A QDS scheme based on superdense teleportation, Universal construction of a full quantum one-way function, Cryptanalysis of the lifted unbalanced oil vinegar signature scheme, Quantum algorithm for Laplacian eigenmap via Rayleigh quotient iteration, Solving Burgers' equation with quantum computing, Improved lattice-based mix-nets for electronic voting, Quantum-assisted blockchain for IoT based on quantum signature, SKC-CCCO: an encryption algorithm for quantum group signature, A novel qutrit representation of quantum image, Quantum approach to accelerate finite volume method on steady computational fluid dynamics problems, Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions, A novel fault-tolerant quantum divider and its simulation, A novel quantum multi-signature protocol based on locally indistinguishable orthogonal product states, A hybrid classical-quantum algorithm for digital image processing, Physical constraint-aware CNOT quantum circuit synthesis and optimization, Analysis of client-side security for long-term time-stamping services, Security comparisons and performance analyses of post-quantum signature algorithms, A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle, Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm, Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018, An injectivity analysis of Crystals-Kyber and implications on quantum security, Adventures in Supersingularland, Delegating signing rights in a multivariate proxy signature scheme, A quantum version of Pollard's Rho of which Shor's algorithm is a particular case, Efficient quantum feature extraction for CNN-based learning, Homomorphic encryption: a mathematical survey, Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4, Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits, Twin-field quantum encryption protocol for E-payment based on blockchain, Uncovering instabilities in variational-quantum deep Q-networks, Two-step robust control design of quantum gates via differential evolution, Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms, QuanPath: achieving one-step communication for distributed quantum circuit simulation, Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures, Using a resource theoretic perspective to witness and engineer quantum generalized contextuality for prepare-and-measure scenarios, Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy, A review of developments in superconducting quantum processors, A fully secure lattice-based signcryption with designated equality test in standard model, Key-oblivious encryption from isogenies with application to accountable tracing signatures, Time-release cryptography from minimal circuit assumptions, A survey on single server private information retrieval in a coding theory perspective, A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion, A survey on functional encryption, Efficiently masking polynomial inversion at arbitrary order, On security notions for encryption in a quantum world, An efficient key recovery attack against NTRUReEncrypt from AsiaCCS 2015, Quantum designated verifier signature scheme with semi-trusted third-party, A universal quantum algorithm for weighted maximum cut and Ising problems, On new problems in asymmetric cryptography based on error-resistant coding, Enhanced post-quantum key escrow system for supervised data conflict of interest based on consortium blockchain, Security analysis and improvement of a blind semi-quantum signature, A key agreement protocol based on spiking neural P systems with anti-spikes, Representing the integer factorization problem using ordered binary decision diagrams, Semi-quantum designated verifier signature scheme, N-to-M JOINT REMOTE STATE PREPARATION OF 2-LEVEL STATES, Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems, CSIDH on the Surface, An Optimal Separation of Randomized and Quantum Query Complexity, Polynomial selection for computing Gröbner bases, LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4, Some error analysis for the quantum phase estimation algorithms, Arbitrated quantum signature protocol with boson sampling-based random unitary encryption, A Modified Adiabatic Quantum Algorithm for Evaluation of Boolean Functions, Performing fully parallel constraint logic programming on a quantum annealer, Solving Lyapunov equation by quantum algorithm, Massively parallel quantum computer simulator, eleven years later, Conditional quantum circuit Born machine based on a hybrid quantum-classical framework, A multivariate identity-based broadcast encryption with applications to the Internet of Things, Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling, Quantum oblivious transfer based on entanglement swapping, Improving the implementation of quantum blockchain based on hypergraphs, Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method, Lower‐ and Higher‐Order Nonclassical Properties of Photon Added and Subtracted Displaced Fock States, Implementation of Controlled‐NOT Gate by Lyapunov Control, Quantum algorithm for estimating largest eigenvalues, Two-party quantum key agreement with six-particle entangled states against collective noise, Quantum fast corner detection algorithm, Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation, Dynamic full quantum one-way function based on quantum circuit mapping, The dependence of computability on numerical notations, A design method for efficient variational quantum models based on specific Pauli axis, Synthesis and Upper Bound of Schmidt Rank of Bipartite Controlled‐Unitary Gates, Design of quantum error correcting code for biased error on heavy-hexagon structure, An efficient quantum algorithm for spectral estimation, Quantity study on a novel quantum neural network with alternately controlled gates for binary image classification, Pieceable fault tolerant conversion between 5-qubit code and 7-CSS code, Recovering Rainbow's secret key with a first-order fault attack, A low failure rate quantum algorithm for searching maximum or minimum, Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions, Graphic lattices made by graph felicitous-type labelings and colorings of topological coding, Cryptanalysis of a round optimal lattice-based multisignature scheme, Grover on \(SIMON\), Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project, Sample-size-reduction of quantum states for the noisy linear problem, A new quantum multi-party signature protocol based on SNOP states without arbitrator, Generation and robustness of quantum entanglement in spin graphs, Security analysis and improvement of a quantum multi-signature protocol, Feasible private set intersection in quantum domain, A novel quantum \((t, n)\) threshold group signature based on \(d\)-dimensional quantum system, Amplitude estimation via maximum likelihood on noisy quantum computer, Perfect controlled joint remote state preparation of arbitrary multi-qubit states independent of entanglement degree of the quantum channel, A novel quantum anonymous ranking protocol, An improved efficient identity-based quantum signature scheme, Long time dynamics of a single-particle extended quantum walk on a one-dimensional lattice with complex hoppings: a generalized hydrodynamic description, Implementations of heralded quantum Toffoli and Fredkin gates assisted by waveguide-mediated photon scattering, Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations, Quantum algorithm for matrix logarithm by integral formula, Some new constructions of optimal asymmetric quantum codes, A quantum voting protocol using single-particle states, A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor, A hybrid classical-quantum approach for multi-class classification, Configurable sublinear circuits for quantum state preparation, Probabilistic nonunitary gate in imaginary time evolution, A practical quantum designated verifier signature scheme for E-voting applications, Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting), Quantum all-subkeys-recovery attacks on 6-round Feistel-\(2^\ast\) structure based on multi-equations quantum claw finding, The Argument Against Quantum Computers, Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme, Proposing a Novel Method for Increasing Security in the Network Communication, Quantum circuits synthesis using Householder transformations, Unnamed Item, Unnamed Item, Image classification with quantum pre-training and auto-encoders, Delocalization power of global unitary operations on quantum information, Revisiting the Cubic UOV Signature Scheme, Qutrit magic state distillation, GEOMETRIC PHASE AND TOPOLOGY QUANTUM GATES USING PARALLEL TRANSPORTATION, Committing to Quantum Resistance, Better: A Speed-and-Risk-Configurable Defence for Bitcoin Against a Fast Quantum Computing Attack, How to construct CSIDH on Edwards curves, Bitcoin Crypto–Bounties for Quantum Capable Adversaries, Open quantum generalisation of Hopfield neural networks, A categorical analogue of the monoid semiring construction, Number partitioning on a quantum computer, Unnamed Item, Unnamed Item, IMPLEMENTATION OF ONE-QUBIT DEUTSCH–JOZSA ALGORITHM IN A TRIPLE-WELL SEMICONDUCTOR QUANTUM DOT SYSTEM, From the Bloch Sphere to Phase-Space Representations with the Gottesman–Kitaev–Preskill Encoding, Comparative Analysis of Random Generators, Unnamed Item, High-Speed Hardware Implementation of Rainbow Signature on FPGAs, NEW ARBITRATED QUANTUM SIGNATURE WITH MESSAGE RECOVERY, Nonclassical mixed states that generate zero entanglement with a beam splitter, Bounding quantum gate error rate based on reported average fidelity, BERRY PHASES OF A COMPOSITE SYSTEM IN EXTERNAL FIELDS, Unnamed Item, Rank-Metric Codes and Their Applications, Homomorphic Encryption, QUANTUM DISCORD AS A RESOURCE IN QUANTUM COMMUNICATION, A quantum interior-point predictor–corrector algorithm for linear programming, Cryptanalyses of Candidate Branching Program Obfuscators, Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem
