Abstract
In this paper, we present three algebraic constructions of authentication codes with secrecy. The codes have simple algebraic structures and are easy to implement. They are asymptotically optimal with respect to certain bounds. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Ding, C., Salomaa, A., Solé, P., & Tian, X. (2003). Three constructions of authentication/secrecy codes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2643, 24–33. https://doi.org/10.1007/3-540-44828-4_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free