{'fraction_non_alphanumeric': 0.020022246941045607, 'fraction_numerical': 0.004449388209121246, 'mean_word_length': 5.081081081081081, '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}}
Expanding the use of quasi-subfield polynomials

The supposed hardness of the elliptic curve discrete logarithm problem is crucial for modern cryptographic protocols. In 2018, the article "Quasi-subfield polynomials and the elliptic curve discrete logarithm problem" by Huang et al. highlighted the potential of a specific class of polynomials to solve this problem at lower cost. Following different tracks that were mentioned in this article, we were able to prove new results: we have exhibited and proved five more families of quasi-subfield polynomials. They are based on additive groups and multiplicative groups. Nonetheless, none of the found families allows us to beat already known ECDLP algorithms. We explained this obstruction in the case of linearized polynomials by proving a new tight lower bound. Finally, we briefly discuss how other algebraic groups could be used in this context.