{'fraction_non_alphanumeric': 0.0311284046692607, 'fraction_numerical': 0.0019455252918287938, 'mean_word_length': 4.722222222222222, '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}}
Factorization of Polynomials over Z/(pn)

In this paper, we deal with the problem of finding a factorization of a monic primary polynomial f ∈ Z/(pn)[x] into irreducible factors. This task has been completely solved when pn does not divide the discriminant of f, while there is not an efficient method of determining a factorization when this happens and finding an explicit factorization can be hard for polynomials of high degree. We discuss some techniques to speed up the computation, focusing on the case n=3.