Logarithm Cartesian authentication codes.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5943313
- scientific article; zbMATH DE number 16480
- A Generic Construction of Cartesian Authentication Codes
- Authentication codes and combinatorial designs.
- Cartesian authentication codes from functions with optimal nonlinearity.
- A password authentication scheme based on discrete logarithms
- scientific article; zbMATH DE number 1440053
- scientific article; zbMATH DE number 1944666
- A logic of authentication
- A new key authentication scheme based on discrete logarithms
Cites work
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 1303147 (Why is no real title available?)
- scientific article; zbMATH DE number 1500491 (Why is no real title available?)
- Cartesian authentication codes from functions with optimal nonlinearity.
- Codes Which Detect Deception
- Combinatorial characterizations of authentication codes
- Combinatorial characterizations of authentication codes. II
- Constructions of authentication codes from algebraic curves over finite fields
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- New hash functions and their use in authentication and set equality
- Universal hashing and geometric codes
Cited in
(6)- Two new classes of binary sequence pairs with three-level cross-correlation
- Highly nonlinear mappings
- scientific article; zbMATH DE number 16480 (Why is no real title available?)
- New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
- Constructions of external difference families and disjoint difference families
- Cartesian authentication codes from functions with optimal nonlinearity.
This page was built for publication: Logarithm Cartesian authentication codes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398375)
