Almost resilient function is the generalization of resilient function and has important applications in multiple authenticate codes and almost security cryptographic Boolean functions. In this paper, some constructions are provided. In particular, the Theorem 3 in [7] is improved. As e-almost (n, 1, k)-resilient functions play an important role in the secondary constructions, we concluded some properties and constructions. Specially we presented a spectral characterization of almost (n, 1, k)-resilient functions, which can be used to identify an almost (n, 1, k)-resilient function by computing its walsh spectra. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ke, P., Zhang, J., & Wen, Q. (2006). Results on almost resilient functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3989 LNCS, pp. 421–432). Springer Verlag. https://doi.org/10.1007/11767480_29
Mendeley helps you to discover research relevant for your work.