Three Constructions of Authentication Codes from Power Function over Finite Fields with Perfect Secrecy

被引：0

作者：

Wang, Xiuli ^{[1
]}

Chen, Shangdi ^{[1
]}

Zhou, Maoyuan ^{[1
,2
]}

机构：

[1] Civil Aviat Univ China, Coll Sci, Tianjin 300300, Peoples R China

[2] Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China

来源：

ARS COMBINATORIA | 2012年 / 106卷

关键词：

authentication codes; cryptography; rings; perfect nonlinear mappings; secrecy;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, we present three algebraic constructions of authentication codes from power function over finite fields with secrecy and realize an application of some properties about authentication codes in [1]. 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.

引用

页码：225 / 234

页数：10

共 12 条

[1] BRICKELL EF, 1984, C NUMERANTIUM, V43, P141
[2] Cartesian authentication codes from functions with optimal nonlinearity
Chanson, S
Ding, CS
Salomaa, A
[J]. THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 1737 - 1752
[3] Three constructions of authentication codes with perfect secrecy
Ding, CS
Tian, XJ
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2004, 33 (03) : 227 - 239
[4] Johansson T., 1995, Designs, Codes and Cryptography, V6, P205, DOI 10.1007/BF01388475
[5] MASSEY JL, 1986, CRYPTOGRAPHY SELECTI, P3
[6] PEI DY, 1995, J CRYPTOL, V8, P177
[7] Rees R. S., 1996, Designs, Codes and Cryptography, V7, P239, DOI 10.1023/A:1018094824862
[8] Rosenbaum U., 1993, Journal of Cryptology, V6, P135, DOI 10.1007/BF00198462
[9] SGARRO A, 1993, J COMPUTER SECURITY, V2, P53
[10] COMMUNICATION THEORY OF SECRECY SYSTEMS
SHANNON, CE
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1949, 28 (04): : 656 - 715

← 1 2 →