Three constructions of authentication/secrecy codes

DOI10.1016/J.JPAA.2004.08.008zbMath1068.94021OpenAlexW2017403270MaRDI QIDQ1770530

Arto Salomaa, Xiaojian Tian, Cunsheng Ding, Patrick Solé

Publication date: 7 April 2005

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpaa.2004.08.008

zbMATH Keywords

authenticationimpersonation attacksecrecy codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Invariants of trace forms in odd characteristic and authentication codes ⋮ On the relationships between perfect nonlinear functions and universal hash families ⋮ A class of authentication codes with secrecy ⋮ Power trace functions over finite fields ⋮ Systematic authentication codes using additive polynomials ⋮ Коды аутентификации с секретностью (обзор)

Cites Work

• Three constructions of authentication codes with perfect secrecy
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• A construction for authentication/secrecy codes from certain combinatorial designs
• A lower bound on authentication after having observed a sequence of messages
• A shift register construction of unconditionally secure authentication codes
• Bounds and characterizations of authentication/secrecy schemes
• Highly nonlinear mappings
• Information-theoretic bounds for authentication codes and block designs
• Combinatorial characterizations of authentication codes. II
• Authentication Theory/Coding Theory
• The Combinatorics of Perfect Authentication Schemes
• Codes Which Detect Deception
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three constructions of authentication/secrecy codes