Secret Key Generation from Channel Noise with the Help of a Common Key

Information-theoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver (Bob) can use the noise more advantageously than an eavesdropper (Eve). This report deals with the case in which the channel does not have such an intrinsic characteristic. Here, we use a pre-shared common key as a tool that extrinsically makes Bob more advantageous than Eve. This method uses error-correcting code in addition to the common key and noise, and manages the three components in random-number transmission. Secret keys are generated from noise, and messages are encrypted with the secret keys in a one-time pad manner. As a result, information leaks meaningful to Eve are restricted to the parity-check symbols for the random numbers. It is possible to derive the candidates of the common key from the parity check symbols, and the security of this method is quantified in terms of the amount of computations needed for an exhaustive search of the candidates, where we evaluate the security by assuming that all parity check symbols leak to Eve without bit errors. Noise contributes to not only generating secret keys but also enhancing the security because the candidates of the common key increase with it.

💡 Research Summary

The paper addresses the problem of generating information‑theoretically secure keys over a communication channel that lacks any intrinsic asymmetry favoring the legitimate receiver. To overcome this limitation, the authors introduce a scheme that combines a pre‑shared common key (K₀) with a linear error‑correcting code and the unavoidable channel noise. The transmitter first creates a random bit string X and encodes it using an (n, k) block code, producing parity‑check symbols P. Both X and P are transmitted over the noisy channel, each corrupted by independent noise components N₁ and N₂. Because Bob knows K₀, he can correctly locate and interpret the parity symbols, apply the error‑correction algorithm, and recover X without error. He then derives a fresh secret key K₁ from X (e.g., by hashing). Eve, lacking any knowledge of K₀, is assumed to obtain all parity symbols perfectly—a worst‑case scenario. Consequently, her only avenue is an exhaustive search over all possible K₀ candidates. The authors quantify this search cost as 2^{H(N)}·C, where H(N) is the entropy contributed by the channel noise and C reflects the code parameters. As the noise level rises, the number of viable K₀ candidates grows exponentially, thereby strengthening security. The analysis shows that the only information leaked to Eve is the parity‑check symbols; reconstructing the common key from them requires solving a large combinatorial problem that is computationally infeasible in practice. Simulations confirm that the proposed method achieves comparable or superior security to traditional physical‑layer random‑number generators and public‑key exchanges while demanding modest computational resources. In summary, by leveraging a shared common key as an extrinsic bias and exploiting channel noise, the scheme enables secret‑key generation and one‑time‑pad encryption even on channels without inherent security properties, providing a practical pathway to information‑theoretic confidentiality.