The following pages link to Codes Which Detect Deception (Q4401320):
Displaying 50 items.
- MMH* with arbitrary modulus is always almost-universal (Q269733) (← links)
- Three constructions of perfect authentication codes from projective geometry over finite fields (Q298846) (← links)
- On modes of operations of a block cipher for authentication and authenticated encryption (Q301626) (← links)
- Study on the security of the authentication scheme with key recycling in QKD (Q331437) (← links)
- A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields (Q364440) (← links)
- A new multi-linear universal hash family (Q369419) (← links)
- Combinatorial bounds and characterizations of splitting authentication codes (Q601095) (← links)
- A generalization of the formulas for intersection numbers of dual polar association schemes and their applications (Q624531) (← links)
- Singular linear space and its applications (Q640002) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Variants of Wegman-Carter message authentication code supporting variable tag lengths (Q831162) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- On message authentication with a correlated setup (Q903369) (← 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)
- Error-correcting codes and cryptography (Q937222) (← links)
- Systematic authentication codes using additive polynomials (Q1009061) (← links)
- Generalised dual arcs and Veronesean surfaces, with applications to cryptography (Q1024369) (← links)
- Perfect difference systems of sets and Jacobi sums (Q1043561) (← links)
- Some constructions and bounds for authentication codes (Q1109006) (← links)
- A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
- New hash functions and their use in authentication and set equality (Q1152713) (← links)
- New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
- Incidence structures applied to cryptography (Q1199628) (← links)
- Construction of Cartesian authentication codes from unitary geometry (Q1203950) (← links)
- Cryptology: The mathematics of secure communication (Q1259538) (← links)
- A lower bound on authentication after having observed a sequence of messages (Q1310451) (← links)
- A shift register construction of unconditionally secure authentication codes (Q1321559) (← links)
- Geometry of classical groups over finite fields and its applications (Q1377777) (← links)
- Logarithm Cartesian authentication codes. (Q1398375) (← links)
- Cartesian authentication codes from functions with optimal nonlinearity. (Q1401188) (← links)
- Constructions of difference covering arrays. (Q1421336) (← links)
- On designs in compact metric spaces and a universal bound on their size (Q1584452) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test (Q1696144) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers (Q1749791) (← links)
- A coding theory construction of new systematic authentication codes (Q1763702) (← links)
- Three constructions of authentication/secrecy codes (Q1770530) (← 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)
- Authentication codes for nontrusting parties obtained from rank metric codes (Q1904420) (← links)
- Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes (Q1910425) (← links)
- Anzahl formulas of subspaces in symplectic spaces and their applications (Q1947093) (← links)
- Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector (Q2016427) (← links)
- The circulant hash revisited (Q2033521) (← links)
- Construction of authentication codes based on orthogonal array and Latin square (Q2140799) (← links)
