{'fraction_non_alphanumeric': 0.010901883052527254, 'fraction_numerical': 0.0, 'mean_word_length': 5.9655172413793105, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment

Establishing secret keys from the commonly-observed randomness of reciprocal wireless propagation channels has recently received considerable attention. We consider such key establishment between two multiantenna nodes that use beamforming for communication, showing that the upper bound on the number of key bits that can be generated from the channel observations can be maximized by properly probing the channel. Specifically, we demonstrate that the eigenvectors of the channel spatial covariance matrix should be used as beamformer weights during channel estimation and we optimize the energy allocated to channel estimation for each beamformer weight under a total energy constraint. Finally, by assuming that the channel covariance is separable, we illustrate implementation of the technique for practical beamforming systems and more advanced signal models that incorporate antenna mutual coupling.