{'fraction_non_alphanumeric': 0.018363939899833055, 'fraction_numerical': 0.0, 'mean_word_length': 5.666666666666667, '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}}
Revisiting a primitive: Analysis of approximate message authentication codes

In this paper, a well-known algorithm of approximate message authentication code (AMAC), its generalized scheme and its improved version are reconsidered. Weaknesses are discovered and some solutions for improving the security and performance of the algorithm are suggested. We introduce the number of runs of ones into the old approaches to reduce the noise tolerance combined with two other Boolean functions. Analysis for security, performance and comparison considerations are given along with the simulation results.