Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6053
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Özbudak, Elif Kurtaran | - |
dc.contributor.author | Özbudak, Ferruh | - |
dc.contributor.author | Saygı, Zülfükar | - |
dc.date.accessioned | 2021-09-11T15:34:50Z | - |
dc.date.available | 2021-09-11T15:34:50Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.issn | 0925-1022 | - |
dc.identifier.issn | 1573-7586 | - |
dc.identifier.uri | https://doi.org/10.1007/s10623-010-9461-1 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/6053 | - |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | TUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [TBAG-107T826] | en_US |
dc.description.sponsorship | We would like to thank the anonymous referee for his/her insightful and helpful comments that improved the presentation of this paper. The second and the third authors were supported by TUBITAK under Grant No. TBAG-107T826. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Designs Codes And Cryptography | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Authentication codes with secrecy | en_US |
dc.subject | Algebraic function fields | en_US |
dc.subject | Linearized polynomial | en_US |
dc.title | A Class of Authentication Codes With Secrecy | en_US |
dc.type | Article | en_US |
dc.department | Faculties, Faculty of Science and Literature, Department of Mathematics | en_US |
dc.department | Fakülteler, Fen Edebiyat Fakültesi, Matematik Bölümü | tr_TR |
dc.identifier.volume | 59 | en_US |
dc.identifier.issue | 1-3 | en_US |
dc.identifier.startpage | 287 | en_US |
dc.identifier.endpage | 318 | en_US |
dc.authorid | 0000-0002-7575-3272 | - |
dc.authorid | 0000-0002-1694-9283 | - |
dc.authorid | 0000-0002-0590-9294 | - |
dc.identifier.wos | WOS:000288452200021 | en_US |
dc.identifier.scopus | 2-s2.0-79953281860 | en_US |
dc.institutionauthor | Saygı, Zülfükar | - |
dc.identifier.doi | 10.1007/s10623-010-9461-1 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 07.03. Department of Mathematics | - |
Appears in Collections: | Matematik Bölümü / Department of Mathematics Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
2
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
2
checked on Aug 31, 2024
Page view(s)
94
checked on Dec 16, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.