<p>Many problems in statistical physics, as well as in classical and quantum information theory including quantum cryptography, have much in common, since they are reduced to the processing of exponentially large sets. It has been shown that there is a deep relationship between the distribution of bosons over energy levels and the number of collisions of a random block cipher. It has been shown that the number of collisions is equal to the number of empty levels in the distribution of bosons over levels. The number of collisions is of practical interest, since it determines the complexity of search for keys transmitted through a quantum network.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Bose–Einstein Statistics, Random Block Ciphers, and the One-Time Notepad in Quantum Cryptography

  • S. N. Molotkov,
  • I. S. Sushchev

摘要

Many problems in statistical physics, as well as in classical and quantum information theory including quantum cryptography, have much in common, since they are reduced to the processing of exponentially large sets. It has been shown that there is a deep relationship between the distribution of bosons over energy levels and the number of collisions of a random block cipher. It has been shown that the number of collisions is equal to the number of empty levels in the distribution of bosons over levels. The number of collisions is of practical interest, since it determines the complexity of search for keys transmitted through a quantum network.