A construction for authentication/secrecy codes from certain combinatorial designs

DOI10.1007/BF02351720MaRDI QIDQ1112007zbMATH OpenFDO

Authors D. R. Stinson

Publication date 1988

Published in Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

communication channelperpendicular arrayauthentication code, Secrecy code

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

Recommendations

• Publication:3792622
• On the construction of authentication and secrecy codes
• Isomorphism classes of authentication codes
• The combinatorics of authentication and secrecy codes
• Some constructions and bounds for authentication codes

Cites work

• scientific article; zbMATH DE number 4019075 (Why is no real title available?)
• scientific article; zbMATH DE number 3887703 (Why is no real title available?)
• scientific article; zbMATH DE number 3856985 (Why is no real title available?)
• scientific article; zbMATH DE number 4210147 (Why is no real title available?)
• scientific article; zbMATH DE number 3715579 (Why is no real title available?)
• scientific article; zbMATH DE number 3893245 (Why is no real title available?)
• scientific article; zbMATH DE number 3895109 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Communication Theory of Secrecy Systems*
• Ein elementarer und konstruktiver Beweis für die Zerlegungsgleichheit der Hill'schen Tetraeder mit einem Quader. (An elementary and constructive proof for the equivalence by dissection of the Hill tetrahedra with a rectangular parallelepipedon)
• On Partially Resolvable t–Partitions
• Some constructions and bounds for authentication codes
• Steiner pentagon systems

Cited in

(21)

• scientific article; zbMATH DE number 5283673 (Why is no real title available?)
• On complementary decompositions of the complete graph
• New bound for affine resolvable designs and its application to authentication codes
• scientific article; zbMATH DE number 975409 (Why is no real title available?)
• On the construction of authentication and secrecy codes
• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
• Mosaics of combinatorial designs for information-theoretic security
• scientific article; zbMATH DE number 4045632 (Why is no real title available?)
• scientific article; zbMATH DE number 4057437 (Why is no real title available?)
• The combinatorics of authentication and secrecy codes
• Three constructions of authentication/secrecy codes
• Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• New bounds and constructions for authentication/secrecy codes with splitting
• Information-theoretic bounds for authentication schemes
• A class of authentication codes with secrecy
• scientific article; zbMATH DE number 1024097 (Why is no real title available?)
• The power of primes: security of authentication based on a universal hash-function family
• Some constructions and bounds for authentication codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• A construction for optimal \(c\)-splitting authentication and secrecy codes

This page was built for publication: A construction for authentication/secrecy codes from certain combinatorial designs

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