A construction for authentication/secrecy codes from certain combinatorial designs
From MaRDI portal
Publication:1112007
DOI10.1007/BF02351720zbMath0658.94009MaRDI QIDQ1112007
Publication date: 1988
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items (11)
A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ On complementary decompositions of the complete graph ⋮ A class of authentication codes with secrecy ⋮ A construction for authentication/secrecy codes from 3-homogeneous permutation groups ⋮ Information-theoretic bounds for authentication schemes ⋮ Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Three constructions of authentication/secrecy codes ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ On the construction of authentication and secrecy codes ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner pentagon 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)
- Some constructions and bounds for authentication codes
- Communication Theory of Secrecy Systems*
- Authentication Theory/Coding Theory
- On Partially Resolvable t–Partitions
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Codes Which Detect Deception
This page was built for publication: A construction for authentication/secrecy codes from certain combinatorial designs
