Systematic authentication codes using additive polynomials
From MaRDI portal
Publication:1009061
DOI10.1007/S10623-008-9176-8zbMath1178.94197OpenAlexW2031563017MaRDI QIDQ1009061
Ferruh Özbudak, Zülfükar Saygı
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9176-8
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Authentication schemes from highly nonlinear functions
- Some Artin-Schreier type function fields over finite fields with prescribed genus and number of rational places
- Three constructions of authentication/secrecy codes
- Some constructions of systematic authentication codes using Galois rings
- Curves related to Coulter's maximal curves
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
- Systematic Authentication Codes From Highly Nonlinear Functions
- Codes Which Detect Deception
This page was built for publication: Systematic authentication codes using additive polynomials