A construction for authentication/secrecy codes from 3-homogeneous permutation groups
From MaRDI portal
Publication:909643
DOI10.1016/S0195-6698(13)80058-3zbMATH Open0694.94008MaRDI QIDQ909643FDOQ909643
Authors: D. R. Stinson, Luc Teirlinck 
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
- Three constructions of authentication codes with perfect secrecy
- scientific article; zbMATH DE number 1982612
- Three constructions of authentication/secrecy codes
- scientific article; zbMATH DE number 1247722
- scientific article; zbMATH DE number 4057437
- A construction for authentication/secrecy codes from certain combinatorial designs
- A new class of 3-fold perfect splitting authentication codes
- Three constructions of authentication codes from power function over finite fields with perfect secrecy.
- scientific article; zbMATH DE number 1029235
- scientific article; zbMATH DE number 4070794
Cites Work
- Communication Theory of Secrecy Systems*
- Codes Which Detect Deception
- \(k\)-homogeneous groups
- Title not available (Why is that?)
- Authentication Theory/Coding Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some constructions and bounds for authentication codes
- Some New 5-Designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Steiner pentagon systems
- Title not available (Why is that?)
- 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)
- A construction for authentication/secrecy codes from certain combinatorial designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Title not available (Why is that?)
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- On the construction of authentication and secrecy codes
- Three constructions of authentication/secrecy codes
- The combinatorics of authentication and secrecy codes
- Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
- Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes
- Some highly symmetric authentication perpendicular arrays
- Some perpendicular arrays for arbitrarily large \(t\)
- On 1-factorizations of bipartite Kneser graphs
- Theory of perpendicular arrays
- Monotypical uniformly homogeneous sets of permutations
This page was built for publication: A construction for authentication/secrecy codes from 3-homogeneous permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q909643)
