Methods and systems for content detection in a reconfigurable hardware
First Claim
1. A method in a data processing system for identifying a repeating content in a data stream, the method comprising the steps of:
- computing a hash function for at least one portion of a plurality of portions of the data stream;
incrementing at least one counter of a plurality of counters responsive to the computed hash function result, each counter corresponding to a respective computed hash function result;
identifying the repeating content when the at least one of the plurality of counters exceeds a count value; and
verifying that the identified repeating content is not a benign string.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods and systems consistent with the present invention identify a repeating content in a data stream. A hash function is computed for at least one portion of a plurality of portions of the data stream. The at least one portion of the data stream has benign characters removed therefrom to prevent the identification of a benign string as the repeating content. At least one counter of a plurality of counters is incremented responsive to the computed hash function result. Each counter corresponds to a respective computed hash function result. The repeating content is identified when the at least one of the plurality of counters exceeds a count value. It is verified that the identified repeating content is not a benign string.
272 Citations
33 Claims
-
1. A method in a data processing system for identifying a repeating content in a data stream, the method comprising the steps of:
-
computing a hash function for at least one portion of a plurality of portions of the data stream;
incrementing at least one counter of a plurality of counters responsive to the computed hash function result, each counter corresponding to a respective computed hash function result;
identifying the repeating content when the at least one of the plurality of counters exceeds a count value; and
verifying that the identified repeating content is not a benign string. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A system for identifying a repeating content in a data stream, the system comprising:
-
a hash function computation circuit that computes a hash function for the least one portion of the plurality of portions of the data stream;
a plurality of counters, at least one counter of a plurality of counters being incremented responsive to the computed hash function result, each counter corresponding to a respective computed hash function result;
a repeating content identifier that identifies the repeating content when the at least one of the plurality of counters exceeds a count value; and
a verifier that verifies that the identified repeating content is not a benign string. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
-
33. A system for identifying a repeating content in a data stream, the system comprising:
-
means for computing a hash function for at least one portion of a plurality of portions of the data stream, the at least one portion of the data stream having benign characters removed therefrom to prevent the identification of a benign string as the repeating content;
means for incrementing at least one counter of a plurality of counters responsive to the computed hash function result, each counter corresponding to a respective computed hash function result;
means for identifying the repeating content when the at least one of the plurality of counters exceeds a count value; and
means for verifying that the identified repeating content is not a benign string.
-
Specification