Factoring Safe Semiprimes with a Single Quantum Query
نویسندگان
چکیده
Frédéric Grosshans, Thomas Lawson, François Morain, and Benjamin Smith Laboratoire Aimé Cotton, CNRS, Univ. Paris-Sud, ENS Cachan, Université Paris-Saclay, 91405 Orsay, France LTCI — Télécom ParisTech, 23 avenue d’Italie, 75013, Paris, France École Polytechnique/LIX and Institut national de recherche en informatique et en automatique (INRIA) INRIA and École Polytechnique/LIX (Dated: November 16, 2015)
منابع مشابه
Integer Factoring Using Small Algebraic Dependencies
Integer factoring is a curious number theory problem with wide applications in complexity and cryptography. The best known algorithm to factor a number n takes time, roughly, exp(2 log1/3 n· log2/3 logn) (number field sieve, 1989). One basic idea used is to find two squares, possibly in a number field, that are congruent modulo n. Several variants of this idea have been utilized to get other fa...
متن کاملUnderstanding Quantum Algorithms via Query Complexity
Query complexity is a model of computation in which we have to compute a function f(x1, . . . , xN ) of variables xi which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover’s quan...
متن کاملInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm Problem
Problem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithms with subexponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still n...
متن کاملAlternative Models for Quantum Computation
We propose and study two new computational models for quantum computation, and infer new insights about the circumstances that give quantum computers an advantage over classical ones. The bomb query complexity model is a variation on the query complexity model, inspired by the Elitzur-Vaidman bomb tester. In this model after each query to the black box the result is measured, and the algorithm ...
متن کاملLower Bounds on Quantum Query Complexity
Shor’s and Grover’s famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers cannot do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.04385 شماره
صفحات -
تاریخ انتشار 2015