A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields

DOI10.1155/2014/102301zbMath1437.94081OpenAlexW2086941587WikidataQ59049345 ScholiaQ59049345MaRDI QIDQ2336118

Chunli Yang, Shang-di Chen

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/102301

Mathematics Subject Classification ID

Other types of codes (94B60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Authentication schemes from highly nonlinear functions
• Construction of Cartesian authentication codes from unitary geometry
• Multireceiver authentication codes: Models, bounds, constructions, and extensions
• Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
• Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields
• Codes Which Detect Deception
• Constructions of authentication codes from algebraic curves over finite fields
• Message Authentication with Arbitration of Transmitter/Receiver Disputes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields