## 2 Related Works  
In the channel-probing step, imperfect channel reciprocity results in a mismatching error in the extracted bits [18]. To address this issue, the authors in [19] employed the difference in the phase estimates between two signals of different frequencies sinusoids as a randomness source to reduce the channel non-reciprocity component impact, and consequently the mismatching probability. Likewise, the study in [20] improved extraction performance using the phase differentials and amplitudes as distinct sources of randomness. This approach leads to an improvement in the key-generation rate and subsequently accelerates the process of symmetric-key establishment. In [21], a round-trip group key-generation mechanism is proposed. This mechanism entails a member of a group of nodes initiating two signals with random phases and transmitting them through a ring group of nodes in clockwise and counterclockwise directions. By combining the channel response estimates generated by each node from both directions, a high degree of correlation is achieved, enabling the generation of a shared group key. However, while the mechanism demonstrates theoretical efficacy, its practical implementation is hindered by the accumulation of noise across multiple group nodes. Furthermore, the requirement for the entire channel-probing process between all nodes to be completed within \(T_{c}\) poses a challenge. This time frame is often too short, given the short coherence period of high-speed terminals. Although all these studies carefully design the quantization process, quantized observations near the boundary regions can result in a high rate of mismatches. To overcome this limitation, the work in [22] explored the use of guard intervals to reduce the probability of mismatches. However, a trade-off exists between the mismatching probability and the bit extraction rate. Larger boundary regions decrease the mismatching probability and result in a lower bit extraction rate due to the greater number of dropped observations. Multicriteric communication systems encompass partitioning the frequency spectrum into a multitude of parallel subcarriers, which are then used as independent sources of randomness. In [10], a single-side probing mechanism was proposed for an orthogonal frequency division multiplexing (OFDM) system consisting of \(N\) subcarriers. The mechanism involves initiating random phase sequences by a terminal and using the reciprocal characteristics of the channel to mask the mapped preliminary shared key. In the quantization step of the measurement process, optimizing the size of the quantization region is critical for optimizing the performance of the extraction process [23]. The authors in [24] employed the channel gain complement method to counteract the impact of hardware imperfections, such as the carrier frequency offset. It optimizes the thresholding regions of the multi-level quantization process. The mentioned works are premised on a crucial assumption: that all nodes within the network are separated by a minimum distance of \((\lambda/2)\) to ensure that the channel responses between network terminals are decorrelated within \(T_{c}\). In other words, it is important to ensure that all the network terminals are geographically apart by a distance of at least \(\lambda/2\), ensuring that their estimates are decorrelated within \(T_{c}\). This requirement can be practically ensured for vehicle-to-vehicle (V2V) communication through proper physical security measures. However, ensuring such physical security in vehicle-to-infrastructure (V2I) communication may be difficult. An attacker could potentially gain access to the secret features of surrounding terminals by stacking readily available cards onto the transceivers of roadside units. To solve the previously discussed challenge, we present a Diffie-Hellman channel-probing mechanism,detailed in [5], incorporating the Chebyshev chaotic mapping function.