Construction of index generation unit using probabilistic data structures

Abstract

Index generation functions attract increasing interest lately due to their important applications. They can be realized using a circuit called index generation unit. However, it requires additional memory to determine, whether an input vector is valid for that function. The better linear reduction of an index generation function is found, the more memory is used. In this paper, a new type of circuit is proposed. It uses probabilistic data structures to determine the validity of an input element. We show that it can be used to efficiently realize index generation functions at the cost of the small probability of false positives.