{'fraction_non_alphanumeric': 0.019079685746352413, 'fraction_numerical': 0.006734006734006734, 'mean_word_length': 5.326241134751773, '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}}
Analysis of the Chimera Time-Binding Scheme for Authenticating GPS L1C

The Chimera scheme was proposed in [1] for protecting the GPS L1C signal by inserting random markers at the chip level in the spreading code. Rather than being uniformly distributed, the markers’ positions are set by picking one pattern out of m=256 in a predetermined, publicly known lookup table, possibly for efficiency reasons. This work analyzes the Chimera scheme, focusing on the lookup table to evaluate whether this structure affects the security of the system. In particular, we compare it with an ideal uniform distribution of the markers in terms of their robustness against guessing and collision attacks. We then proceed analyzing other possible attack strategies, calculating or lower bounding their success probabilities, and finally validate the result through comparisons with Monte Carlo simulations.