Publication:2724450
From MaRDI portal
zbMath1001.11055MaRDI QIDQ2724450
Publication date: 14 August 2001
simultaneous Diophantine approximation; quantum computing; large composite numbers; polynomial-time quantum factorization algorithm
81P68: Quantum computation
11J13: Simultaneous homogeneous approximation, linear forms
11Y05: Factorization
Related Items
Optimized quantum implementation of AES, Quantum algorithms for computing general discrete logarithms and orders with tradeoffs, On post-processing in the quantum algorithm for computing short discrete logarithms, On completely factoring any integer efficiently in a single run of an order-finding algorithm, Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design