Linear Authentication Codes: Bounds and Constructions

Linear Authentication Codes: Bounds and Constructions

Tác giả: Rei Safavi-Naini , Huaxiong Wang, Chaoping Xing

Nguồn trích: Progress in cryptology-INDOCRYPT 2001-LNCS 22418.7

Năm xuất bản: 1905

Số trang: 135

Tóm tắt:  In this paper, we consider a new class of unconditionally secure authentication codes, called linear authentication code (or linear A-code). We show that a linear A-code can be characterised by a family of subspaces of a vector space over a finite field. We then derive an upper bound on the size of source space when other parameters of the systems, that is the size of the key space and the authenticator space, and the deception probability, are fixed. We give constructions that are asymptotic

Từ khóa: Authentication Codes,Linear Authentication Codes

Tải về