The following pages link to (Q3325623):
Displaying 16 items.
- Three constructions of perfect authentication codes from projective geometry over finite fields (Q298846) (← links)
- A construction for \(t\)-fold perfect authentication codes with arbitration (Q404930) (← links)
- Combinatorial bounds and characterizations of splitting authentication codes (Q601095) (← links)
- A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities (Q892298) (← 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)
- 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)
- A lower bound on authentication after having observed a sequence of messages (Q1310451) (← links)
- A construction for optimal \(c\)-splitting authentication and secrecy codes (Q1650431) (← links)
- Authentication codes in plaintext and chosen-content attacks (Q1910424) (← links)
- Combinational constructions of splitting authentication codes with perfect secrecy (Q2673993) (← links)
- Message Authentication with Arbitration of Transmitter/Receiver Disputes (Q5000238) (← links)
- THE SOLUTION OF SOME CLASSES OF MATRIX GAMES (Q5150754) (← links)
