On the construction of authentication and secrecy codes
From MaRDI portal
Publication:1804982
DOI10.1007/BF01388389zbMath0816.94020MaRDI QIDQ1804982
Publication date: 20 July 1995
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Combinatorial aspects of block designs (05B05) Data encryption (aspects in computer science) (68P25) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Authentication, digital signatures and secret sharing (94A62)
Related Items (4)
A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ Коды аутентификации с секретностью (обзор) ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- The combinatorics of authentication and secrecy codes
- On an infinite class of Steiner systems with \(t=3\) and \(k=6\)
- Some constructions and bounds for authentication codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- 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\)
- Monotypical uniformly homogeneous sets of permutations
- A class of three-designs
- A family of perpendicular arrays achieving perfect 4-fold secrecy
- A Steiner system \(S(5,6,108)\)
- On three-designs of small order
- A family of 4-designs with block size 9
- A new family of 4-designs
- Some New 5-Designs
- On t-Designs and Groups
- An infinite class of 4-designs
This page was built for publication: On the construction of authentication and secrecy codes
