## Abstract

Lo and Ko in [1] have developed some attacks on the cryptosystem called αη [2], claiming that these attacks undermine the security of 077 for both direct encryption and key generation. In this paper, we show that their arguments fail in many different ways. In particular, the first attack in [1] requires channel loss or length of known-plaintext that is exponential in the key length and is unrealistic even for moderate key lengths. The second attack is a Grover search attack based on 'asymptotic orthogonality' and was not analyzed quantitatively in [1]. We explain why it is not logically possible to "pull back" an argument valid only at n = ∞ into a limit statement, let alone one valid for a finite number of transmissions n. We illustrate this by a 'proof using a similar asymptotic orthogonality argument that coherent-state BB84 is insecure for any value of loss. Even if a limit statement is true, this attack is a priori irrelevant as it requires an indefinitely large amount of known-plaintext, resources and processing. We also explain why the attacks in [1] on αη as a key-generation system are based on misinterpretations of [2]. Some misunderstandings in [1] regarding certain issues in cryptography and optical communications are also pointed out. Short of providing a security proof for αη, we provide a description of relevant results in standard cryptography and in the design of αη to put the above issues in the proper framework and to elucidate some security features of this new approach to quantum cryptography.

Original language | English (US) |
---|---|

Pages (from-to) | 561-582 |

Number of pages | 22 |

Journal | Quantum Information and Computation |

Volume | 6 |

Issue number | 7 |

State | Published - Nov 2006 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Statistical and Nonlinear Physics
- Nuclear and High Energy Physics
- Mathematical Physics
- Physics and Astronomy(all)
- Computational Theory and Mathematics