Abstract:

By constructing a new coding algorithm, called uniformization, it is proved that all authentication codes, or systematic authentication codes, can be uniformized into a new class of authentication codes, called uniformized authentication codes, or uniformized systematic authentication codes. With these codes a new lower bound of maximum probabilities of a successful impersonation for all general codes is derived if encoding rule distributions are equiprobable.

Key words: systematic authentication codes, uniformization

authentication codes