An Investigation of R-Chunk Detector Generation on Higher Alphabets

Thomas Stibor¹, Kpatscha M. Bayarou², and Claudia Eckert¹

¹Department of Computer Science, Darmstadt University of Technology
stibor@sec.informatik.tu-darmstadt.de
eckert@sec.informatik.tu-darmstadt.de

²Fraunhofer-Institute Secure Telecooperation (SIT)
bayarou@sit.fraunhofer.de

Abstract. We propose an algorithm for generating all possible generatable r-chunk detectors, which do not cover any elements in self set S. In addition, the algorithm data structure is used to estimate the average number of generatable detectors, dependent on set size S, r-chunk length r and alphabet size . We show that higher alphabets influence the number of generatable detectors in a negative manner.

LNCS 3102, p. 299 ff.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004