Network security: mapping intrusion & anomaly detection to very-high-degree polynomials

Intrusion and anomaly detection involves various techniques for rule-based as well as soft-computing systems. What is introduced here is a novel approach to network security whereby problematic behavior detection is treated as a high to very-high-order polynomial factorization problem. Network security characteristics are drawn from the factorization results and test cases are introduced. The actual details are in the context of the "forward" use case where polynomials are mapped from rule sets. "Reverse" use is also described.