On the construction of authentication and secrecy codes

DOI10.1007/BF01388389zbMATH Open0816.94020MaRDI QIDQ1804982FDOQ1804982

Authors: Tran van Trung 

Publication date: 20 July 1995

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

\(t\)-designsauthentication codesauthentication perpendicular arrayssecrecy codes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• A class of three-designs
• Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
• Title not available (Why is that?)
• On t-Designs and Groups
• Some constructions and bounds for authentication codes
• A family of 4-designs with block size 9
• A new family of 4-designs
• Some New 5-Designs
• The combinatorics of authentication and secrecy codes
• On three-designs of small order
• An infinite class of 4-designs
• Title not available (Why is that?)
• Monotypical uniformly homogeneous sets of permutations
• Title not available (Why is that?)
• A construction for authentication/secrecy codes from certain combinatorial designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• Title not available (Why is that?)
• On an infinite class of Steiner systems with \(t=3\) and \(k=6\)
• 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\)
• A family of perpendicular arrays achieving perfect 4-fold secrecy
• A Steiner system \(S(5,6,108)\)

Cited In (16)

• Коды аутентификации с секретностью (обзор)
• Some constructions and bounds for authentication codes
• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
• Linear authentication codes: bounds and constructions
• Title not available (Why is that?)
• The power of primes: security of authentication based on a universal hash-function family
• Title not available (Why is that?)
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• Security authentication codes constructed by mixed orthogonal array
• Title not available (Why is that?)
• Title not available (Why is that?)
• A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities
• Title not available (Why is that?)
• Title not available (Why is that?)
• A construction for authentication/secrecy codes from certain combinatorial designs
• A class of authentication codes with secrecy

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)