Three constructions of authentication/secrecy codes

DOI10.1016/J.JPAA.2004.08.008zbMATH Open1068.94021OpenAlexW2017403270MaRDI QIDQ1770530FDOQ1770530

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

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

Recommendations

• scientific article; zbMATH DE number 1982612
• Three constructions of authentication codes with perfect secrecy
• Three constructions of authentication codes from power function over finite fields with perfect secrecy.
• scientific article; zbMATH DE number 2127882
• scientific article; zbMATH DE number 4070794

zbMATH Keywords

authenticationimpersonation attacksecrecy codes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• On the relationships between perfect nonlinear functions and universal hash families
• Коды аутентификации с секретностью (обзор)
• Three constructions of authentication codes from power function over finite fields with perfect secrecy.
• Three constructions of authentication codes with perfect secrecy
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• On the construction of authentication and secrecy codes
• Systematic authentication codes using additive polynomials
• Power trace functions over finite fields
• Title not available (Why is that?)
• A coding theory construction of new systematic authentication codes
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• Invariants of trace forms in odd characteristic and authentication codes
• A class of authentication codes with secrecy
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770530)