Photo by vika_strawberrika from unsplash
We count the number of solutions to a power trace function equal to a constant and use this to find the probability of a successful attack on an authentication code… Click to show full abstract
We count the number of solutions to a power trace function equal to a constant and use this to find the probability of a successful attack on an authentication code proposed by Ding et al. (2005) [C. Ding, A. Salomaa, P. Solé and X. Tian, Three constructions of authentication/secrecy codes, J. Pure Appl. Algebra 196 (2005) 149–168].
Keywords:
trace functions;
power trace;
finite fields;
power;
functions finite
Journal Title: Journal of Algebra and Its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Algebra and Its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!