The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 14, 2015

Filed:

Jan. 28, 2014
Applicant:

Alcatel Lucent, Paris, FR;

Inventors:

Kedar S Namjoshi, Basking Ridge, NJ (US);

Girija J Narlikar, Mumbai, IN;

Assignee:

Alcatel Lucent, Boulogne-Billancourt, FR;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 11/00 (2006.01); H04L 29/06 (2006.01); G06F 21/55 (2013.01); G06K 9/00 (2006.01); G06K 9/68 (2006.01); G06K 9/72 (2006.01);
U.S. Cl.
CPC ...
H04L 63/1408 (2013.01); G06F 21/552 (2013.01); H04L 63/0263 (2013.01); H04L 63/1416 (2013.01);
Abstract

A system, method, apparatus and mechanism for estimating worst-case time complexity of a regular expression defining a pattern adapted for identifying malicious packets and comprising one or more back-references (backref-regex) by constructing a non-deterministic finite automaton (NFA) corresponding to the backref-regex (backref-NFA), wherein the backref-NFA comprises a plurality of NFA-states and a respectively labeled edge for each of the one or more back-references of the backref-regex; performing liveness analysis on the backref-NFA to determine for each NFA-state of the backref-NFA a set of back-references alive at the NFA-state; and determining a maximum number of alive back-references over the plurality of NFA-states, wherein the determined maximum number is indicative of the worst-case time complexity of the backref-regex.


Find Patent Forward Citations

Loading…