Constructions of authentication codes from algebraic curves over finite fields

DOI10.1109/18.841168zbMath0997.94028OpenAlexW2108747956MaRDI QIDQ4503578

Xing, Chaoping, Huaxiong Wang, Kwok-Yan Lam

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.841168

zbMATH Keywords

algebraic curvesauthentication codesuniversal hash familiesunconditionally secure codes

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

Secret sharing schemes with partial broadcast channels ⋮ Logarithm Cartesian authentication codes. ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Authentication codes and bipartite graphs ⋮ A coding theory construction of new systematic authentication codes ⋮ A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields ⋮ Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields

This page was built for publication: Constructions of authentication codes from algebraic curves over finite fields