Patentable/Patents/US-8448249
US-8448249

Methods and systems for using lambda transitions for processing regular expressions in intrusion-prevention systems

PublishedMay 21, 2013
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

Methods and systems are provided for using lambda transitions for processing regular expressions in intrusion-prevention systems. In an embodiment, a state-transition table is provided, said table being representative of a predetermined data pattern, and including states having egress events defining transitions to other states. A subject is received for evaluation for the presence of the predetermined data pattern. While using the state-transition table for said evaluation, a first state is transitioned into, the first state having an egress event defining a transition to a second state, a state count corresponding to a number of times the first state has been transitioned into, a state-count threshold, and a state-count condition. After transitioning into the first state, the state count is incremented. Responsive to determining that the state-count condition is satisfied by comparing the incremented state count with the state-count threshold, the transition to the second state is taken.

Patent Claims
16 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method for examining network traffic in an intrusion prevention system and identifying therein the presence of signature data patterns, the method comprising: providing a state-transition table representative of a predetermined data pattern, the state-transition table comprising a plurality of states, each state having a set of egress events, each egress event defining a transition from a current state to a next state; receiving a subject to be evaluated for the presence of the predetermined data pattern; evaluating, by a processor, the subject using the state-transition table for the presence of the predetermined data pattern, wherein the evaluating further includes transitioning into a first state having (a) a first egress event defining a transition to a second state, (b) a state count corresponding to a number of times the first state has been transitioned into, (c) a state-count threshold, and (d) a state-count condition; and after transitioning into the first state, incrementing the state count, and determining whether the state-count condition is satisfied by comparing the incremented state count with the state-count threshold; upon determining that the state-count condition is satisfied, transitioning to the second state; and upon determining that the state-count condition is not satisfied, returning a no-match result from the first state and decrementing the state count.

2

2. The method of claim 1 , wherein the state-transition table is representative of a state diagram, the state diagram representative of the predetermined data pattern.

3

3. The method of claim 1 , wherein the predetermined data pattern is representative of a regular expression.

4

4. The method of claim 1 , wherein each egress event is either a character class or a character string.

5

5. The method of claim 1 , wherein the subject comprises a payload of one or more packets.

6

6. The method of claim 1 , wherein the presence of the predetermined data pattern is indicative of a potential security threat.

7

7. The method of claim 1 , wherein a cursor corresponds to a location in the subject that is currently being evaluated, the cursor having a first value upon transitioning into the first state, and wherein the first state has an associated first-state range in the subject, the first-state range having a first-state-range start and a first-state range end.

8

8. The method of claim 7 , wherein the state-count condition is whether the incremented state count is equal to the state-count threshold.

9

9. The method of claim 8 , wherein transitioning to the second state comprises setting the cursor equal to the first value plus the state-count threshold.

10

10. The method of claim 8 , wherein the second state has an associated second-state range in the subject, the second-state range having a second-state-range start and a second-state-range end, the method further comprising (a) setting the second-state-range start equal to the first-state-range start plus the state-count threshold minus one and (b) setting the second-state-range end equal to the lesser of (i) the first-state-range end plus the state-count threshold minus one and (ii) an end position of the subject.

11

11. The method of claim 7 , wherein transitioning to the second state comprises leaving the cursor equal to the first value.

12

12. The method of claim 7 , wherein the second state has an associated second-state range in the subject, the second-state range having a second-state-range start and a second-state-range end, the method further comprising (a) setting the second-state-range start equal to the cursor and (b) setting the second-state-range end equal to the lesser of (i) the cursor plus the state-count threshold minus one and (ii) the first-state-range end.

13

13. The method of claim 1 , wherein the state-count condition is whether the incremented state count is less than or equal to the state-count threshold.

14

14. The method of claim 1 , wherein transitioning from one state to another state comprises recursively calling a state-search function.

15

15. An intrusion-prevention network device for examining network traffic and identifying therein the presence of signature data patterns, the network device comprising: a network interface; a processor; and data storage comprising: a state-transition table representative of a predetermined data pattern, the state-transition table comprising a plurality of states, each state having a set of egress events, each egress event defining a transition from a current state to a next state; and instructions executable by the processor to: receive a subject to be evaluated for the presence of the predetermined data pattern; while using the state-transition table to evaluate the subject for the presence of the predetermined data pattern, transition into a first state having (a) a first egress event defining a transition to a second state, (b) a state count corresponding to a number of times the first state has been transitioned into, (c) a state-count threshold, and (d) a state-count condition; after transitioning into the first state, increment the state count, and determine whether the state-count condition is satisfied by comparing the incremented state count with the state-count threshold, upon a determination that the state-count condition is satisfied, transition to the second state; and upon a determination that the state-count condition is not satisfied, return a no-match result from the first state and decrement the state count.

16

16. A method for examining network traffic in an intrusion prevention system and identifying therein the presence of signature data patterns, the method comprising: providing a state-transition table representative of a predetermined data pattern, the state-transition table comprising a plurality of states, each state having a set of egress events, each egress event defining a transition from a current state to a next state; receiving a subject to be evaluated for the presence of the predetermined data pattern; evaluating, by a processor, the subject using the state-transition table for the presence of the predetermined data pattern, wherein the evaluating further includes transitioning into a first state having (a) a first egress event defining a transition to a second state, (b) a state count corresponding to a number of times the first state has been transitioned into, (c) a state-count threshold, and (d) a state-count condition; and after transitioning into the first state, incrementing the state count, and determining whether the state-count condition is satisfied by comparing the incremented state count with the state-count threshold and transitioning to the second state in response to the state-count threshold being reached; wherein a cursor corresponds to a location in the subject that is currently being evaluated, the cursor having a first value upon transitioning into the first state, and wherein the first state has an associated first-state range in the subject, the first-state range having a first-state-range start and a first-state range end; and wherein the second state has an associated second-state range in the subject, the second-state range having a second-state-range start and a second-state-range end, the method further comprising (a) setting the second-state-range start equal to the cursor and (b) setting the second-state-range end equal to the lesser of (i) the cursor plus the state-count threshold minus one and (ii) the first-state-range end.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

July 29, 2008

Publication Date

May 21, 2013

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Methods and systems for using lambda transitions for processing regular expressions in intrusion-prevention systems” (US-8448249). https://patentable.app/patents/US-8448249

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.