Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Access

CFO-CR: Carrier Frequency Offset Methodology for High-Rate Common Randomness Generation

Prashanth K. H. Sheshagiri, Martin Reisslein B, Juan Alberto Cabrera, Frank H. P. Fitzek

Published Jan 1, 2025• 6 citations
Publisher

Abstract

Common Randomness (CR) provides sequences of random variables at two physically separated locations. Ideally, the random variables at the two locations should be identical, i.e., have low probability of discrepancy, and should have high entropy. Previous CR research has focused on CR for physical layer security (mainly physical layer secret key generation), where a low CR generation rate, i.e., a low rate of CR bits per second is sufficient. However, emerging semantic communication paradigms, e.g., identification via channels, require high CR rates. We develop and evaluate a Carrier Frequency Offset (CFO) based methodology for high-rate CR generation from reciprocal observations of a common wireless channel between two distinct wireless terminals. The proposed CFO-CR methodology proceeds in several stages, including channel probing, random parameter extraction, noise reduction, quantization, information reconciliation, and randomization. Our evaluations with single-carrier software-defined radios, for which we make measurement traces publicly available, indicate that high-rate CR generation should observe (probe) the CFO and employ a Savitzky Golay low-pass filter with a low cut-off frequency for noise reduction in conjunction with multi-bit quantization, Gray code encoding, and a shuffling based randomization. We provide insights into the tradeoffs between the reconciliation cost for correcting bit discrepancies and the CR generation parameters. Our proposed CFO-CR methodology can generate 2048 bits of CR at a comparatively low reconciliation cost of 72 bytes while only making 256 channel observations and passing all common randomness tests. For generating 2048 bits of CR, other state-of-the-art approaches either require more channel observations ($\ge 2048$) or incur a higher reconciliation cost ($\ge 450$bytes).

DOI
10.1109/access.2025.3529665

Related papers

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

Chaos is a Ladder (and Increases With Storage): Aiding Communications With RSSI-Based Common Randomness

Prashanth K. H. Sheshagiri, Martin Reisslein B, Juan Alberto Cabrera +1 more

Common randomness (CR) is an important resource for future communication paradigms. Identification is one such future communication paradigm, and it has been proven that CR-assisted identification can improve identification capacity by a double exponential factor. To achieve this, the common source of observation must be perfectly correlated and contain sufficient entropy. Channel reciprocity-based CR generation (alternatively termed Physical Layer Secret Key (PLSK) generation) is one such CR generation scheme. Existing high-rate CR generation is based on the Carrier Frequency Offset (CFO); for practical implementation, CFO-based CR generation would require a re-design of the existing protocol stacks to pass the CFO from the physical layer to the higher protocol layers. In contrast, we develop high-rate CR generation based on the Received Signal Strength Indicator (RSSI), which is highly practical as the RSSI is passed to and widely used by the higher protocol layers in existing communication protocol stacks. For RSSI-based CR generation, we demonstrate that the memory resources dedicated to storing channel information play an important role in achieving a high CR generation rate. Specifically, we demonstrate, through an experimental testbed with Ettus N210 USRPs Software Defined Radios (SDRs) (from which we make datasets publicly available), how allocating higher memory resources for storing accurate RSSI channel information at the terminals (transceivers) increases the achievable CR generation rate.

IEEE Access•Jan 1, 2026•0 citations

Improving Common Randomness Rate using Software Defined Radios

Prashanth K. H. Sheshagiri, Juan Alberto Cabrera, Frank H. P. Fitzek

Common Randomness (CR) can be considered as a resource for future communication devices and systems that not only improve the transmission capacity of identification systems but also provide robust information theoretical security. To achieve this, CR must be generated such that the reconciliation cost must be lower than the size of the key that is being generated. This can be achieved by using filters. In this live demonstration, we prepare a CR generation mechanism using Software Defined Radio (SDR) and achieve this tradeoff using multi-bit quantization and Savitzky Golay filter.

IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•May 20, 2024•2 citations

Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness Generation

Prashanth K. H. Sheshagiri, Juan Alberto Cabrera, Frank H. P. Fitzek

Identification is a new paradigm introduced for goal-oriented communication that verifies the semantics of the intended message rather than just transmitting the message bits, which is traditionally done in classical communication systems. One of the key techniques to improve randomized identification capacity is by introducing Common Randomness (CR). Physical Layer Secret Key (PLSK) is one such CR generation technique, where terminals generate secret keys based on changes in channel reciprocity between the wireless terminals and are mainly used for PHY layer encryption. However, the traditional way of evaluating PLSK techniques through bit discrepancies, bit generation rate, and entropy is not sufficient for evaluating their usefulness for identification. This paper proposes three key novel information theory paradigms that can be used alongside other mentioned parameters to evaluate key PLSK techniques for their usefulness in identification, i.e., CR rate, CR capacity, and cost function, followed by a supporting implementation using Software Defined Radio (SDR)s.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•1 citation

Shared Secret Key Generation via Carrier Frequency Offsets

Waqas Aman, Aneeqa Ijaz, Muhammad Mahboob Ur Rahman +2 more

This work presents a novel method to generate secret keys shared between a legitimate node pair (Alice and Bob) to safeguard the communication between them from an unauthorized node (Eve). To this end, we exploit the reciprocal carrier frequency offset (CFO) between the legitimate node pair to extract common randomness out of it to generate shared secret keys. The proposed key generation algorithm involves standard steps: the legitimate nodes exchange binary phase-shift keying (BPSK) signals to perform blind CFO estimation on the received signals, and do equi-probable quantization of the noisy CFO estimates followed by information reconciliation-to distil a shared secret key. Furthermore, guided by the Allan deviation curve, we distinguish between the two frequency-stability regimes-when the randomly time-varying CFO process i) has memory, ii) is memoryless; thereafter, we compute the key generation rate for both regimes. Simulation results show that the key disagreement rate decreases exponentially with increase in the signal to noise ratio of the link between Alice and Bob. Additionally, the decipher probability of Eve decreases as soon as either of the two links observed by the Eve becomes more degraded compared to the link between Alice and Bob.

arXiv:1902.10998•IEEE Vehicular Technology Conference•Apr 1, 2019•11 citations

Carrier Frequency Offset Based Shared Randomness for Secure Transmission in M-PSK NOMA

Caner Göztepe, Güneş Karabulut Kurt, Berna Özbek

Power domain non-orthogonal multiple access (NOMA) enhances spectral efficiency by superposing multiple users in the same time-frequency resource block at the expense of exposing the users' data. However, current approaches to improve the secrecy levels of users are limited to rate reduction. This paper proposes a secure NOMA system based on the shared randomness extracted from the reciprocal carrier frequency offsets (CFOs) between the transmitter-receiver pairs for M-ary phase-shift keying. As multiple users will have physically separated oscillators, it will result in independent CFOs among users. This randomness is used to introduce a constellation rotation in the transmitted symbols. We show that under ideal CFO estimates, the proposed approach achieves perfect secrecy among all NOMA users without introducing any rate reduction. We also demonstrate the practical applicability of the proposed approach by using a software-defined radio-based test bed.

IEEE International Black Sea Conference on Communications and Networking•Jul 4, 2023•0 citations
Common Randomness (CR) provides sequences of random variables at two physically separated locations. Ideally, the random variables at the two locations should be identical, i.e., have low probability of discrepancy, and should have high entropy. Previous CR research has focused on CR for physical layer security (mainly physical layer secret key generation), where a low CR generation rate, i.e., a low rate of CR bits per second is sufficient. However, emerging semantic communication paradigms, e.g., identification via channels, require high CR rates. We develop and evaluate a Carrier Frequency Offset (CFO) based methodology for high-rate CR generation from reciprocal observations of a common wireless channel between two distinct wireless terminals. The proposed CFO-CR methodology proceeds in several stages, including channel probing, random parameter extraction, noise reduction, quantization, information reconciliation, and randomization. Our evaluations with single-carrier software-defined radios, for which we make measurement traces publicly available, indicate that high-rate CR generation should observe (probe) the CFO and employ a Savitzky Golay low-pass filter with a low cut-off frequency for noise reduction in conjunction with multi-bit quantization, Gray code encoding, and a shuffling based randomization. We provide insights into the tradeoffs between the reconciliation cost for correcting bit discrepancies and the CR generation parameters. Our proposed CFO-CR methodology can generate 2048 bits of CR at a comparatively low reconciliation cost of 72 bytes while only making 256 channel observations and passing all common randomness tests. For generating 2048 bits of CR, other state-of-the-art approaches either require more channel observations (≥2048\ge 2048≥2048) or incur a higher reconciliation cost (≥450\ge 450≥450bytes).
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
Common randomness (CR) is an important resource for future communication paradigms. Identification is one such future communication paradigm, and it has been proven that CR-assisted identification can improve identification capacity by a double exponential factor. To achieve this, the common source of observation must be perfectly correlated and contain sufficient entropy. Channel reciprocity-based CR generation (alternatively termed Physical Layer Secret Key (PLSK) generation) is one such CR generation scheme. Existing high-rate CR generation is based on the Carrier Frequency Offset (CFO); for practical implementation, CFO-based CR generation would require a re-design of the existing protocol stacks to pass the CFO from the physical layer to the higher protocol layers. In contrast, we develop high-rate CR generation based on the Received Signal Strength Indicator (RSSI), which is highly practical as the RSSI is passed to and widely used by the higher protocol layers in existing communication protocol stacks. For RSSI-based CR generation, we demonstrate that the memory resources dedicated to storing channel information play an important role in achieving a high CR generation rate. Specifically, we demonstrate, through an experimental testbed with Ettus N210 USRPs Software Defined Radios (SDRs) (from which we make datasets publicly available), how allocating higher memory resources for storing accurate RSSI channel information at the terminals (transceivers) increases the achievable CR generation rate.
Common Randomness (CR) can be considered as a resource for future communication devices and systems that not only improve the transmission capacity of identification systems but also provide robust information theoretical security. To achieve this, CR must be generated such that the reconciliation cost must be lower than the size of the key that is being generated. This can be achieved by using filters. In this live demonstration, we prepare a CR generation mechanism using Software Defined Radio (SDR) and achieve this tradeoff using multi-bit quantization and Savitzky Golay filter.
Identification is a new paradigm introduced for goal-oriented communication that verifies the semantics of the intended message rather than just transmitting the message bits, which is traditionally done in classical communication systems. One of the key techniques to improve randomized identification capacity is by introducing Common Randomness (CR). Physical Layer Secret Key (PLSK) is one such CR generation technique, where terminals generate secret keys based on changes in channel reciprocity between the wireless terminals and are mainly used for PHY layer encryption. However, the traditional way of evaluating PLSK techniques through bit discrepancies, bit generation rate, and entropy is not sufficient for evaluating their usefulness for identification. This paper proposes three key novel information theory paradigms that can be used alongside other mentioned parameters to evaluate key PLSK techniques for their usefulness in identification, i.e., CR rate, CR capacity, and cost function, followed by a supporting implementation using Software Defined Radio (SDR)s.
This work presents a novel method to generate secret keys shared between a legitimate node pair (Alice and Bob) to safeguard the communication between them from an unauthorized node (Eve). To this end, we exploit the reciprocal carrier frequency offset (CFO) between the legitimate node pair to extract common randomness out of it to generate shared secret keys. The proposed key generation algorithm involves standard steps: the legitimate nodes exchange binary phase-shift keying (BPSK) signals to perform blind CFO estimation on the received signals, and do equi-probable quantization of the noisy CFO estimates followed by information reconciliation-to distil a shared secret key. Furthermore, guided by the Allan deviation curve, we distinguish between the two frequency-stability regimes-when the randomly time-varying CFO process i) has memory, ii) is memoryless; thereafter, we compute the key generation rate for both regimes. Simulation results show that the key disagreement rate decreases exponentially with increase in the signal to noise ratio of the link between Alice and Bob. Additionally, the decipher probability of Eve decreases as soon as either of the two links observed by the Eve becomes more degraded compared to the link between Alice and Bob.
Power domain non-orthogonal multiple access (NOMA) enhances spectral efficiency by superposing multiple users in the same time-frequency resource block at the expense of exposing the users' data. However, current approaches to improve the secrecy levels of users are limited to rate reduction. This paper proposes a secure NOMA system based on the shared randomness extracted from the reciprocal carrier frequency offsets (CFOs) between the transmitter-receiver pairs for M-ary phase-shift keying. As multiple users will have physically separated oscillators, it will result in independent CFOs among users. This randomness is used to introduce a constellation rotation in the transmitted symbols. We show that under ideal CFO estimates, the proposed approach achieves perfect secrecy among all NOMA users without introducing any rate reduction. We also demonstrate the practical applicability of the proposed approach by using a software-defined radio-based test bed.