From: Jim Choate <ravage@ssz.com>
Date: Thu, 29 Jan 1998 05:15:17 +0800
To: cypherpunks@ssz.com
Subject: shor.html
Message-ID: <199801282110.PAA09102@einstein.ssz.com>
MIME-Version: 1.0
Content-Type: text/plain



   
   
   
   
     _________________________________________________________________
   
   next up previous
   Next: Introduction
   
     _________________________________________________________________
   
   
   
   
   
 ALGORITHMS FOR QUANTUM COMPUTATION: *[1EX] DISCRETE LOG AND FACTORING *[2EX]
                               EXTENDED ABSTRACT
                                       
   
   
   Peter W. Shor
   AT&T Bell Labs
   Room 2D-149
   600 Mountain Ave.
   Murray Hill, NJ 07974 USA
   *[2ex] email: shor@research.att.com 
   
   
   
   
   
   
   
  Abstract:
  
   This paper gives algorithms for the discrete log and the factoring
   problems that take random polynomial time on a quantum computer (thus
   giving the first examples of quantum cryptanalysis). 
   
   
   
     _________________________________________________________________
   
     * Introduction
     * Quantum Computation
     * Building Unitary Transformations
     * Discrete Log: The Easy Case
     * A Note on Precision
     * Discrete Log: The General Case
     * Factoring
     * Acknowledgements
     * References
     * About this document ... 
       
   
   
     _________________________________________________________________
   
   
   
    Isaac Chuang
    Thu Aug 31 08:48:03 PDT 1995