Three constructions of authentication codes with perfect secrecy

被引：13

作者：

Ding, CS ^{[1
]}

Tian, XJ ^{[1
]}

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2004年 / 33卷 / 03期

关键词：

authentication codes; cryptography; perfect nonlinear mappings; secrecy;

D O I：

10.1023/B:DESI.0000036248.82691.11

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we present three algebraic constructions of authentication codes with secrecy. The first and the third class are optimal. Some of the codes in the second class are optimal, and others in the second class are asymptotically optimal. All authentication codes in the three classes provide perfect secrecy.

引用

页码：227 / 239

页数：13

共 17 条

[1]

BRICKELL EF, 1984, C NUMERANTIUM, V43, P141

[2] Bounds and Characterizations of Authentication/Secrecy Schemes [J].

Casse L.R.A. ;

Martin K.M. ;

Wild P.R. .

Designs, Codes and Cryptography, 1998, 13 (2) :107-129

[3] Cartesian authentication codes from functions with optimal nonlinearity [J].

Chanson, S ;

Ding, CS ;

Salomaa, A .

THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) :1737-1752

[4]

DESOETE M, 1988, LECTURE NOTES COMPUT, V330, P57

[5] CODES WHICH DETECT DECEPTION [J].

GILBERT, EN ;

MACWILLIAMS, FJ ;

SLOANE, NJA .

BELL SYSTEM TECHNICAL JOURNAL, 1974, 53 (03) :405-424

[6]

MASSEY JL, 1986, CRYPTOGRAPHY SELECTI, P3

[7] THE COMBINATORICS OF PERFECT AUTHENTICATION SCHEMES [J].

MITCHELL, C ;

WALKER, M ;

WILD, P .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (01) :102-107

[8]

PEI DY, 1995, J CRYPTOL, V8, P177

[9]

Rees R. S., 1996, Designs, Codes and Cryptography, V7, P239, DOI 10.1023/A:1018094824862

[10]

Rosenbaum U., 1993, Journal of Cryptology, V6, P135, DOI 10.1007/BF00198462

← 1 2 →