A class of authentication codes with secrecy

2011-04-01
OZBUDAK, ELİF KURTARAN
Özbudak, Ferruh
SAYGI, ZÜLFÜKAR
We study a class of authentication codes with secrecy. We determine the maximum success probabilities of the impersonation and the substitution attacks on these codes and the level of secrecy. Therefore we give an answer to an open problem stated in Ding et al. (J Pure Appl Algebra 196:149-168, 2005). Our proofs use the number of rational places of a certain class of algebraic function fields. We determine this number by extending the corresponding results of E. Cak double dagger ak and F. A-zbudak (Finite Fields Appl 14(1):209-220, 2008). Our authentication codes use a map which is not perfect nonlinear in certain subcases. We give an extended and unified approach so that the parameters of our authentication codes are good also when the corresponding map is not perfect nonlinear.
DESIGNS CODES AND CRYPTOGRAPHY

Suggestions

Results on some authentication codes
Kurtaran Özbudak, Elif; Özbudak, Ferruh; Department of Cryptography (2009)
In this thesis we study a class of authentication codes with secrecy. We obtain the maximum success probability of the impersonation attack and the maximum success probability of the substitution attack on these authentication codes with secrecy. Moreover we determine the level of secrecy provided by these authentication codes. Our methods are based on the theory of algebraic function fields over finite fields. We study a certain class of algebraic function fields over finite fields related to this class of...
A Randomness test based on postulate r-2 on the number of runs
Şeker, Okan; Doğanaksoy, Ali; Department of Cryptography (2014)
Random values are considered as an indispensable part of cryptography, since they are necessary for almost all cryptographic protocols. Most importantly, key generation is done by random values and key itself should behave like a random value. Randomness is tested by statistical tests and hence, security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this thesis we focus on randomness postulates of Solomon W. Golomb in particular, second postulate which is about r...
NEW TMVP-BASED MULTIPLICATION ALGORITHMS FOR POLYNOMIAL QUOTIENT RINGS AND APPLICATION TO POST-QUANTUM CRYPTOGRAPHY
Keskinkurt Paksoy, İrem; Cenk, Murat; Department of Cryptography (2022-7-28)
One of the quantum-safe cryptography research areas is lattice-based cryptography. Most lattice-based schemes need efficient algorithms for multiplication in polynomial quotient rings. The fastest algorithm known for multiplication is the Number Theoretic Transform (NTT), which requires certain restrictions on the parameters of the ring, such as prime modulus. Direct NTT application is not an option for some schemes that do not comply with these restrictions, e.g., the two finalists of the PQC standardizati...
Linear codes from weakly regular plateaued functions and their secret sharing schemes
Mesnager, Sihem; Özbudak, Ferruh; Sinak, Ahmet (2019-03-01)
Linear codes, the most significant class of codes in coding theory, have diverse applications in secret sharing schemes, authentication codes, communication, data storage devices and consumer electronics. The main objectives of this paper are twofold: to construct three-weight linear codes from plateaued functions over finite fields, and to analyze the constructed linear codes for secret sharing schemes. To do this, we generalize the recent contribution of Mesnager given in (Cryptogr Commun 9(1):71-84, 2017...
On provable security of some public key encryption schemes
Hanoymak, Turgut; Akyıldız, Ersan; Selçuk, Ali Aydın; Department of Cryptography (2012)
In this thesis, we analyse the security criteria of some public key encryption schemes. In this respect, we present the notion of adversarial goals and adversarial capabilities. We give the definition of provably security by means of several games between the challenger and the adversary in some security models, namely the standard model and the random oracle model. We state the main differences between these two models and observe the advantage of the success probability of the adversary in breaking the cr...
Citation Formats
E. K. OZBUDAK, F. Özbudak, and Z. SAYGI, “A class of authentication codes with secrecy,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 287–318, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32828.