In this paper, we present a passive attack for finding out the secrets used in MAP (Minimalist Mutual Authentication Protocol), which is an authentication protocol between RFID tags and RFID readers.… (More)

We investigate graph based secret sharing schemes and its information ratio, also called complexity, measuring the maximal amount of information the vertices has to store. It was conjectured that in… (More)

In the paper two variants of a combinatorial problem for the set F n q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem… (More)

In the paper two variants of a combinatorial problem for the set F q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was… (More)

We examine finite words over an alphabet Γ = {a, ā; b, b̄} of pairs of letters, where each word w1w2...wt is identified with its reverse complement w̄t...w̄2w̄1 (where ā = a, b̄ = b). We seek the… (More)