We introduce perfect authenticity and investigate its properties. Perfect authenticity extends Shannon's notion of perfect secrecy and is shown to have similar requirement in terms of the number of keys. We also define optimal A-codes, derive bounds on the number of keys and give characterization theorems when the number of encoding rules satisfies the bounds.
|Number of pages||4|
|Journal||National Conference Publication - Institution of Engineers, Australia|
|Issue number||94 /9|
|Publication status||Published - 1994|