737 research outputs found
Fast and User-friendly Quantum Key Distribution
Some guidelines for the comparison of different quantum key distribution
experiments are proposed. An improved 'plug & play' interferometric system
allowing fast key exchange is then introduced. Self-alignment and compensation
of birefringence remain. Original electronics implementing the BB84 protocol
and allowing user-friendly operation is presented. Key creation with 0.1 photon
per pulse at a rate of 486 Hz with a 5.4% QBER - corresponding to a net rate of
210Hz - over a 23 Km installed cable was performed.Comment: 21 pages, 6 figures, added referenc
A Practical Cryptanalysis of the Algebraic Eraser
Anshel, Anshel, Goldfeld and Lemieaux introduced the Colored Burau Key
Agreement Protocol (CBKAP) as the concrete instantiation of their Algebraic
Eraser scheme. This scheme, based on techniques from permutation groups, matrix
groups and braid groups, is designed for lightweight environments such as RFID
tags and other IoT applications. It is proposed as an underlying technology for
ISO/IEC 29167-20. SecureRF, the company owning the trademark Algebraic Eraser,
has presented the scheme to the IRTF with a view towards standardisation.
We present a novel cryptanalysis of this scheme. For parameter sizes
corresponding to claimed 128-bit security, our implementation recovers the
shared key using less than 8 CPU hours, and less than 64MB of memory.Comment: 15 pages. Updated references, with brief comments added. Minor typos
corrected. Final version, accepted for CRYPTO 201
Generation of eigenstates using the phase-estimation algorithm
The phase estimation algorithm is so named because it allows the estimation
of the eigenvalues associated with an operator. However it has been proposed
that the algorithm can also be used to generate eigenstates. Here we extend
this proposal for small quantum systems, identifying the conditions under which
the phase estimation algorithm can successfully generate eigenstates. We then
propose an implementation scheme based on an ion trap quantum computer. This
scheme allows us to illustrate two simple examples, one in which the algorithm
effectively generates eigenstates, and one in which it does not.Comment: 5 pages, 3 Figures, RevTeX4 Introduction expanded, typos correcte
From quantum cellular automata to quantum lattice gases
A natural architecture for nanoscale quantum computation is that of a quantum
cellular automaton. Motivated by this observation, in this paper we begin an
investigation of exactly unitary cellular automata. After proving that there
can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in
one dimension, we weaken the homogeneity condition and show that there are
nontrivial, exactly unitary, partitioning cellular automata. We find a one
parameter family of evolution rules which are best interpreted as those for a
one particle quantum automaton. This model is naturally reformulated as a two
component cellular automaton which we demonstrate to limit to the Dirac
equation. We describe two generalizations of this automaton, the second of
which, to multiple interacting particles, is the correct definition of a
quantum lattice gas.Comment: 22 pages, plain TeX, 9 PostScript figures included with epsf.tex
(ignore the under/overfull \vbox error messages); minor typographical
corrections and journal reference adde
Quantum asymmetric cryptography with symmetric keys
Based on quantum encryption, we present a new idea for quantum public-key
cryptography (QPKC) and construct a whole theoretical framework of a QPKC
system. We show that the quantum-mechanical nature renders it feasible and
reasonable to use symmetric keys in such a scheme, which is quite different
from that in conventional public-key cryptography. The security of our scheme
is analyzed and some features are discussed. Furthermore, the state-estimation
attack to a prior QPKC scheme is demonstrated.Comment: 8 pages, 1 figure, Revtex
Quantum resource estimates for computing elliptic curve discrete logarithms
We give precise quantum resource estimates for Shor's algorithm to compute
discrete logarithms on elliptic curves over prime fields. The estimates are
derived from a simulation of a Toffoli gate network for controlled elliptic
curve point addition, implemented within the framework of the quantum computing
software tool suite LIQ. We determine circuit implementations for
reversible modular arithmetic, including modular addition, multiplication and
inversion, as well as reversible elliptic curve point addition. We conclude
that elliptic curve discrete logarithms on an elliptic curve defined over an
-bit prime field can be computed on a quantum computer with at most qubits using a quantum circuit of at most Toffoli gates. We are able to classically simulate the
Toffoli networks corresponding to the controlled elliptic curve point addition
as the core piece of Shor's algorithm for the NIST standard curves P-192,
P-224, P-256, P-384 and P-521. Our approach allows gate-level comparisons to
recent resource estimates for Shor's factoring algorithm. The results also
support estimates given earlier by Proos and Zalka and indicate that, for
current parameters at comparable classical security levels, the number of
qubits required to tackle elliptic curves is less than for attacking RSA,
suggesting that indeed ECC is an easier target than RSA.Comment: 24 pages, 2 tables, 11 figures. v2: typos fixed and reference added.
ASIACRYPT 201
Basic concepts in quantum computation
Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and
function evaluations 3 Algorithms and their complexity 4 From interferometers
to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase
estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional
quantum dynamics 11 Decoherence and recoherence 12 Concluding remarksComment: 37 pages, lectures given at les Houches Summer School on "Coherent
Matter Waves", July-August 199
- …