Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
On construction of resilient functions
ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Constructions of almost resilient functions
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Cryptographically resilient functions
IEEE Transactions on Information Theory
Almost security of cryptographic Boolean functions
IEEE Transactions on Information Theory
Improved construction of nonlinear resilient S-boxes
IEEE Transactions on Information Theory
On the security of 4-bit involutive S-boxes for lightweight designs
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
| Hi-index | 0.00 |
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 ε-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.