We construct perfect authentication codes from the projective geometry over finite fields. There are three major constructions. The first construction is a perfect authentication code with splitting, the second construction is a perfect authentication codes with arbitration, and the third construction is a perfect authentication code without arbitration which is an extension of the second construction. Their parameters and probabilities of successful attacks are computed. (C) 2014 Elsevier Inc. All rights reserved.
机构:
Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R ChinaHong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
Ding, CS
Salomaa, A
论文数: 0引用数: 0
h-index: 0
机构:Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
Salomaa, A
Solé, P
论文数: 0引用数: 0
h-index: 0
机构:Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
Solé, P
Tian, XJ
论文数: 0引用数: 0
h-index: 0
机构:Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China