Common Randomness Generation for Post-Shannon Communication
Prashanth Kumar Herooru Sheshagiri
Common Randomness (CR) as a resource is gaining increasing use cases for addressing futuristic communication demands such as scalability, technological sovereignty, and trustworthiness. For instance, CR can be applied to enhance data encryption. It also enables scalable identification (ID) codes and can support up to double-exponential ID capacity. Moreover, CR strengthens wireless communication systems by providing robustness against jamming attacks. However, from the viewpoint of a communication system, two distinct terminals or devices that wish to generate CR must first observe a correlated random source. In a wireless communication system, this source can be the channel’s stochastic nature, as reflected in the received signal. Traditionally, such an attempt has already been made for physical-layer secret key generation. However, the primary objective of PLSK is to provide information-theoretic security, which does not require generating CR at a very high rate. In novel communication methods such as ID-codes, for a discrete memoryless channel, the ID capacity is lower-bounded by CR capacity. In other words, to realize the benefits of CR assisted ID codes, it is required to generate a vast number of CR bits from very few channel observations. Therefore, there is a need to re-examine the PLSK methodology and modify it so that the resulting generated CR can be adopted into novel communication concepts, such as ID codes. This thesis aims to redesign PLSK so that the resulting information-theoretic CR rate more closely approaches the CR capacity than traditional PLSK schemes. The thesis introduces an initial PLSK implementation on Software-Defined Radios (SDRs) and discusses the trade-offs of attempting to improve the rate of CR generation in the PLSK system. Subsequently, the PLSK method is redesigned to enhance the CR rate. This is achieved through a two-step process: modifying CR generation methods and improving the storage of their components. In the methods section, I combine filters with low cutoff frequencies, multi-bit quantization, and gray-code encoding with a novel functional block called randomization. In the storage section, I propose introducing a 16-bit RSSI instead of an 8-bit RSSI to enhance CR rate through a novel paradigm called engineering entropy. I demonstrate and discuss the resulting improvement in the CR rate achieved with SDRs, compared to the corresponding state-of-the-art PLSK strategy.:1 Introduction 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.4 Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Physical Layer Secret Key Generation for Post-Quantum Cryptography 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Implementation of Physical Layer Secret Key (PLSK) . . . . . . . 9 2.3 Experimental Setup . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.6 Further Development . . . . . . . . . . . . . . . . . . . . . . . . 15 3 Overview of Common Randomness Generation 17 3.1 Theoretical Foundation . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 Illustrative Example for Common Randomness Generation . . . 19 4 ImprovingCommonRandomness Rate Through Functional Blocks 23 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.2 Improving Common Randomness (CR) Rate . . . . . . . . . . . 26 4.3 Review of CR Generation Capacity . . . . . . . . . . . . . . . . 27 4.4 Individual Stages . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 4.5 Evaluation Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . 38 4.6 The CFO-CR Testbed: The Experimental Setup . . . . . . . . . . 40 4.7 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 4.8 Conclusion and Future Directions . . . . . . . . . . . . . . . . . 54 5 Improving Common Randomness Rate Through RSSI Storage 59 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 5.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 5.3 General System Model . . . . . . . . . . . . . . . . . . . . . . . 61 5.4 Extraction Stages . . . . . . . . . . . . . . . . . . . . . . . . . . 63 5.5 Testbed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 5.6 Evaluation Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . 71 5.7 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 5.8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 Conclusions 91 Bibliography 93
•Jan 1, 2026•0 citations