{'fraction_non_alphanumeric': 0.018207282913165267, 'fraction_numerical': 0.008403361344537815, 'mean_word_length': 4.674603174603175, '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}}
Efficient code-based one-time signature from automorphism groups with syndrome compatibility

In this paper we propose a new one-time signature algorithm based on coding theory. The algorithm uses properties of automorphism group of certain codes to dramatically decrease the size of the public key of the scheme. By considering the action of cyclic shifts or the action of the group PSL2(p) we obtain public keys of less than 18 kilobits for a signature of 7 kilobits. Overall the scheme we propose is perfectly fitted to be used with Merkle tree and proposes a very good trade-off between size of key and size of signatures compared to other code-based signature schemes, with multi-time signatures of size 28kb.