Conditional beam splitting attack on quantum key distribution

We present a novel attack on quantum key distribution based on the idea of adaptive absorption [calsam01]. The conditional beam splitting attack is shown to be much more efficient than the conventional beam spitting attack, achieving a performance similar to the, powerful but currently unfeasible, photon number splitting attack. The implementation of the conditional beam splitting attack, based solely on linear optical elements, is well within reach of current technology.Comment: Submitted to Phys. Rev.

Quantum key distribution without alternative measurements

Entanglement swapping between Einstein-Podolsky-Rosen (EPR) pairs can be used to generate the same sequence of random bits in two remote places. A quantum key distribution protocol based on this idea is described. The scheme exhibits the following features. (a) It does not require that Alice and Bob choose between alternative measurements, therefore improving the rate of generated bits by transmitted qubit. (b) It allows Alice and Bob to generate a key of arbitrary length using a single quantum system (three EPR pairs), instead of a long sequence of them. (c) Detecting Eve requires the comparison of fewer bits. (d) Entanglement is an essential ingredient. The scheme assumes reliable measurements of the Bell operator.Comment: REVTeX, 5 pages, 2 figures. Published version with some comment

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

Gate Elimination for Linear Functions and New Feebly Secure Constructions

Abstract. We consider gate elimination for linear functions and show two general forms of gate elimination that yield novel corollaries. Using these corollaries, we construct a new linear feebly secure trapdoor function that has order of security 5 which exceeds the previous record 4 for linear constructions. We also give detailed proofs for nonconstructive circuit complexity bounds on linear functions