Pages that link to "Item:Q3695175"

The following pages link to Authentication Theory/Coding Theory (Q3695175):

Displaying 50 items.

• Complete weight enumerators of some linear codes and their applications (Q306065) (← links)
• Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families (Q738842) (← links)
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups (Q909643) (← links)
• The combinatorics of authentication and secrecy codes (Q914645) (← links)
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) (← links)
• Information-theoretic bounds for authentication schemes (Q918497) (← links)
• Authentication codes and bipartite graphs (Q932829) (← links)
• Some constructions and bounds for authentication codes (Q1109006) (← links)
• A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
• New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
• Incidence structures applied to cryptography (Q1199628) (← links)
• Combinatorial characterizations of authentication codes (Q1200311) (← links)
• A lower bound on authentication after having observed a sequence of messages (Q1310451) (← links)
• Geometry of classical groups over finite fields and its applications (Q1377777) (← links)
• Cartesian authentication codes from functions with optimal nonlinearity. (Q1401188) (← links)
• Constructions of difference covering arrays. (Q1421336) (← links)
• New combinatorial designs and their applications to authentication codes and secret sharing schemes. (Q1428540) (← links)
• A construction for optimal \(c\)-splitting authentication and secrecy codes (Q1650431) (← links)
• Message authentication based on cryptographically secure CRC without polynomial irreducibility test (Q1696144) (← links)
• A coding theory construction of new systematic authentication codes (Q1763702) (← links)
• Three constructions of authentication/secrecy codes (Q1770530) (← links)
• New constructions of systematic authentication codes from three classes of cyclic codes (Q1783702) (← links)
• New methods of construction of Cartesian authentication codes from geometries over finite commutative rings (Q1787190) (← links)
• Further results on asymmetric authentication schemes (Q1854283) (← links)
• Multireceiver authentication codes: Models, bounds, constructions, and extensions (Q1854288) (← links)
• Information-theoretic bounds for authentication codes and block designs (Q1903343) (← links)
• Authentication codes in plaintext and chosen-content attacks (Q1910424) (← links)
• Association schemes based on singular symplectic geometry over finite fields and its application (Q1932625) (← links)
• On the equivalence of authentication codes and robust (2, 2)-threshold schemes (Q2033514) (← links)
• Construction of authentication codes based on orthogonal array and Latin square (Q2140799) (← links)
• A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields (Q2254537) (← links)
• Association schemes based on singular linear spaces and its applications (Q2350305) (← links)
• Subspaces in \(d\)-bounded distance-regular graphs and their applications (Q2426435) (← links)
• Algebraic manipulation detection codes (Q2438532) (← links)
• A new class of optimal 3-splitting authentication codes (Q2491277) (← links)
• A-codes from rational functions over Galois rings (Q2491296) (← links)
• Combinational constructions of splitting authentication codes with perfect secrecy (Q2673993) (← links)
• Codes for Detection of Limited View Algebraic Tampering (Q2980863) (← links)
• Коды аутентификации с секретностью (обзор) (Q3381884) (← links)
• Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings (Q3452337) (← links)
• A TWOOA construction for multi-receiver multi-message authentication codes (Q3516764) (← links)
• Isomorphism classes of authentication codes (Q4824807) (← links)
• Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry (Q4846560) (← links)
• Message Authentication with Arbitration of Transmitter/Receiver Disputes (Q5000238) (← links)
• THE SOLUTION OF SOME CLASSES OF MATRIX GAMES (Q5150754) (← links)
• Keyed hash functions (Q5235423) (← links)
• Quantum Authentication with Key Recycling (Q5270367) (← links)
• New Family of Non-Cartesian Perfect Authentication Codes (Q5323009) (← links)
• Unconditionally Secure Approximate Message Authentication (Q5323012) (← links)
• On Efficient Message Authentication Via Block Cipher Design Techniques (Q5387102) (← links)