scientific article
From MaRDI portal
Publication:2724450
zbMath1001.11055MaRDI QIDQ2724450
Publication date: 14 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
simultaneous Diophantine approximationquantum computinglarge composite numberspolynomial-time quantum factorization algorithm
Quantum computation (81P68) Simultaneous homogeneous approximation, linear forms (11J13) Factorization (11Y05)
Related Items (5)
Optimized quantum implementation of AES ⋮ On completely factoring any integer efficiently in a single run of an order-finding algorithm ⋮ On post-processing in the quantum algorithm for computing short discrete logarithms ⋮ Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design ⋮ Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
This page was built for publication:
