Combinatorial designs for authentication and secrecy codes
From MaRDI portal
Recommendations
Cited in
(15)- Mosaics of combinatorial designs for information-theoretic security
- scientific article; zbMATH DE number 446495 (Why is no real title available?)
- scientific article; zbMATH DE number 3954809 (Why is no real title available?)
- scientific article; zbMATH DE number 1342086 (Why is no real title available?)
- scientific article; zbMATH DE number 1024097 (Why is no real title available?)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Combinatorial designs and cryptography, revisited
- Authentication codes and combinatorial designs.
- On the resolutions of cyclic Steiner triple systems with small parameters
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
- scientific article; zbMATH DE number 975409 (Why is no real title available?)
- Jordan derivations on prime rings
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- New advances in designs, codes and cryptography, Stinson66, Toronto, Canada, June 13--17, 2022 (to appear)
- Disjoint difference families and their applications
This page was built for publication: Combinatorial designs for authentication and secrecy codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3164540)
