On the construction of authentication and secrecy codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4070794
- scientific article; zbMATH DE number 2127882
- Some constructions and bounds for authentication codes
- scientific article; zbMATH DE number 4045632
- A construction for authentication/secrecy codes from certain combinatorial designs
- scientific article; zbMATH DE number 4057437
- Коды аутентификации с секретностью (обзор)
- scientific article; zbMATH DE number 1982612
- Three constructions of authentication/secrecy codes
- The combinatorics of authentication and secrecy codes
Cites work
- A class of three-designs
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- A construction for authentication/secrecy codes from certain combinatorial designs
- A family of 4-designs with block size 9
- A family of perpendicular arrays achieving perfect 4-fold secrecy
- A new family of 4-designs
- A Steiner system \(S(5,6,108)\)
- An infinite class of 4-designs
- Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes
- scientific article; zbMATH DE number 4019075 (Why is no real title available?)
- scientific article; zbMATH DE number 3643278 (Why is no real title available?)
- scientific article; zbMATH DE number 4172989 (Why is no real title available?)
- scientific article; zbMATH DE number 4041961 (Why is no real title available?)
- scientific article; zbMATH DE number 3715579 (Why is no real title available?)
- scientific article; zbMATH DE number 4185614 (Why is no real title available?)
- Monotypical uniformly homogeneous sets of permutations
- On an infinite class of Steiner systems with \(t=3\) and \(k=6\)
- On t-Designs and Groups
- On three-designs of small order
- Some constructions and bounds for authentication codes
- Some friends of Alltop's designs 4-(2f+1,5,5)
- Some highly symmetric authentication perpendicular arrays
- Some New 5-Designs
- Some perpendicular arrays for arbitrarily large \(t\)
- The combinatorics of authentication and secrecy codes
Cited in
(17)- Some constructions and bounds for authentication codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- Some highly symmetric authentication perpendicular arrays
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- A class of authentication codes with secrecy
- Security authentication codes constructed by mixed orthogonal array
- The power of primes: security of authentication based on a universal hash-function family
- Коды аутентификации с секретностью (обзор)
- scientific article; zbMATH DE number 5283673 (Why is no real title available?)
- scientific article; zbMATH DE number 5713310 (Why is no real title available?)
- scientific article; zbMATH DE number 4045632 (Why is no real title available?)
- scientific article; zbMATH DE number 4057437 (Why is no real title available?)
- scientific article; zbMATH DE number 1302854 (Why is no real title available?)
- Linear authentication codes: bounds and constructions
- scientific article; zbMATH DE number 7310202 (Why is no real title available?)
- A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities
This page was built for publication: On the construction of authentication and secrecy codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804982)