[Paper Review] Coherent pulse position modulation quantum cipher supported by secret key

Masaki Sohma, Osamu Hirota|arXiv (Cornell University)|Jul 10, 2010

Quantum Information and Cryptography2 references4 citations

TL;DR

This paper proposes a coherent pulse position modulation (CPPM) quantum cipher that enables high-speed, information-theoretically secure communication using coherent states with finite energy. By applying unitary operators derived from symplectic transformations to PPM-encoded signals, the scheme ensures that Eve’s error probability approaches 1 even with access to the secret key, proving rigorous security beyond the Shannon limit through asymptotic analysis.

ABSTRACT

A quantum cipher supported by a secret key so called keyed communication in quantum noise (KCQ) is very attractive in implementing high speed key generation and secure data transmission. However, Yuen-2000 as a basic model of KCQ has a difficulty to ensure the quantitative security evaluation because all physical parameter for the cipher system is finite. Recently, an outline of a generalized scheme so called coherent pulse position modulation(CPPM) to show the rigorous security analysis is given, where the parameters are allowed to be asymptotical. This may open a new way for the quantum key distribution with coherent states of considerable energy and high speed. In this paper, we clarify a generation method of CPPM quantum signal by using a theory of unitary operator and symplectic transformation, and show an asymptotic property of security and its numerical examples.

Motivation & Objective

• To develop a practical quantum cipher that supports high-speed data transmission using coherent states with finite but substantial energy.
• To overcome the limitations of conventional quantum key distribution (QKD) by enabling faster key generation and transmission rates.
• To provide a rigorous security analysis for quantum ciphers based on coherent states, addressing the lack of quantitative security evaluation in prior schemes like Yuen-2000.
• To establish a theoretical framework for generating CPPM quantum signals using unitary operators and symplectic transformations.
• To demonstrate that the scheme exceeds the Shannon limit by ensuring Eve’s error probability converges to 1 even with secret key access.

Proposed method

• The scheme encodes n-bit blocks into PPM quantum states with 2^n slots, each carrying a coherent state pulse in one of N slots.
• A unitary operator U_Ki, generated via a PRNG seeded by a secret key Ks, is applied to transform PPM states into CPPM states.
• The unitary transformation is derived using quantum characteristic functions and symplectic matrix representations to ensure uniform signal spacing in phase space.
• Bob reverses the transformation using the adjoint unitary operator U_Ki† to recover the original PPM state and decode the message.
• Eve’s attack is modeled as heterodyne detection followed by maximum-likelihood decoding, with error probability analyzed using Gaussian and Q-function approximations.
• Lower bounds on Eve’s error probability are derived using Gallager’s bound, showing convergence to 1 as n → ∞.

Experimental results

Research questions

• RQ1 Can a quantum cipher using coherent states with finite energy achieve information-theoretic security beyond the Shannon limit?
• RQ2 How can coherent pulse position modulation (CPPM) be systematically generated using unitary and symplectic transformations?
• RQ3 What is the asymptotic behavior of Eve’s error probability when she gains access to the secret key after measurement?
• RQ4 Does the scheme ensure that Bob can decode correctly while Eve cannot, even with full knowledge of the secret key and PRNG?
• RQ5 What are the bandwidth and hardware requirements for implementing CPPM in practical optical communication systems?

Key findings

• The CPPM quantum cipher achieves information-theoretic security beyond the Shannon limit, as Eve’s error probability P_e^het(key) converges to 1 as n → ∞.
• For a signal energy S = 20, Bob’s error probability is less than 10^(-8.69), indicating near-perfect decoding by the legitimate receiver.
• The lower bound for Eve’s error probability P_e^het(key) exceeds 0.9 only when n > 50 (i.e., N > 2^50), indicating extremely high security for large n.
• The convergence speed of Eve’s error probability lower bound is very slow, requiring n > 50 to reach 90% error probability, which confirms the scheme’s robustness.
• The required channel bandwidth scales exponentially as W_CPPM = (2^n / n) * W_s, posing a major challenge for practical implementation.
• The theoretical framework based on unitary operators and symplectic transformations enables systematic generation of CPPM signals with uniform signal spacing in phase space.