Constructions of authentication codes from algebraic curves over finite fields
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1222889
- On families of hash functions via geometric codes and concatenation
- scientific article; zbMATH DE number 1594314
- Universal hashing and authentication codes
- Three constructions of authentication codes from power function over finite fields with perfect secrecy.
Cited in
(13)- Systematic authentication codes using additive polynomials
- Logarithm Cartesian authentication codes.
- Cartesian authentication codes from functions with optimal nonlinearity.
- Construction of some codes suitable for both side channel and fault injection attacks
- A coding theory construction of new systematic authentication codes
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
- scientific article; zbMATH DE number 1643921 (Why is no real title available?)
- Construction of multi-receiver multi-fold authentication codes from singular symplectic geometry over finite fields
- scientific article; zbMATH DE number 1222889 (Why is no real title available?)
- Linear authentication codes: bounds and constructions
- Function fields over finite fields and their applications to cryptography
- Secret sharing schemes with partial broadcast channels
- Authentication codes and bipartite graphs
This page was built for publication: Constructions of authentication codes from algebraic curves over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503578)