Date Added: Feb 2011
The authors analyze the fundamental limits of key generation and describe an implementation based on error correcting codes. They show that key extraction based on channel coefficients significantly outperforms key extraction based on Received Signal Strength Indicators (RSSI). The development in this paper is based on an IEEE 802.11a Orthogonal Frequency-Division Multiplexing (OFDM) model and they demonstrate that it is feasible to use the sampled channel coefficients in OFDM as the key source. The key extraction problem is cast as a Slepian-Wolf coding and decoding problem. They construct regular and irregular forms of binary and non-binary Low-Density Parity Check (LDPC) codes to prototype their key extraction.