Results 291 to 300 of about 425,450 (331)
Some of the next articles are maybe not open access.

Construction of resilient functions

Wuhan University Journal of Natural Sciences, 2005
Based on the relationship between nonlinearity and resiliency of a multi-output function, we present a method for constructing nonintersecting linear codes from packing design. Through these linear codes, we obtainn-variable,m-output,t-resilient functions with very high nonlinearity. their nonlinearities are currently the best results for most of cases.
Zhang Jie, Wen Qiao-yan
openaire   +1 more source

Cubic Boolean Functions With Highest Resiliency

IEEE Transactions on Information Theory, 2004
We classify those cubic m-variable Boolean functions which are (m $4)-resilient. Our main result is that there are four types of such functions, depending on the structure of the support of their Walsh spectra.
C. Carlet, P. Charpin
openaire   +1 more source

Leakage-Resilient Authenticated Encryption from Leakage-Resilient Pseudorandom Functions

2021
In this work we study the leakage resilience of authenticated encryption schemes. We show that, if one settles for non-adaptive leakage, leakage-resilient authenticated encryption schemes can be built from leakage-resilient pseudorandom functions.
Juliane Krämer, Patrick Struck
openaire   +1 more source

On Binary Resilient Functions

Designs, Codes and Cryptography, 2003
This neat paper exploits a description given by Carlet and Guillot for the efficient construction of binary resilient functions. It utilizes a combinatorial formulation of the algebraic normal form. The mechanism of blowing up uses Steiner designs as ingredients, thus creating an interesting link to design theory.
openaire   +2 more sources

Preadolescents' executive functions and resilience development: A cascade model of resilience resources and resilient functioning

Journal of Adolescence
AbstractIntroductionExecutive functions (EF), encompassing inhibition, updating, and shifting, are widely acknowledged as cognitive factors that promote resilience. However, prior research examining the association between EF and resilience has been hampered by inconsistent conceptualizations of resilience and an overreliance on cross‐sectional designs.
Yanlin Zhou   +4 more
openaire   +2 more sources

Resilient functions over finite fields

IEEE Transactions on Information Theory, 2003
Resilient functions play an important role in the art of information security. In this correspondence, we discuss the existence, construction, and enumeration of resilient functions over finite fields. We show that, for each finite field GF(q) with q > 3, we can easily construct a large number of (q, n, 1, n - 1) resilient functions, most of which ...
null Yupu Hu, null Guozhen Xiao
openaire   +1 more source

Group Actions on Binary Resilient Functions

Applicable Algebra in Engineering, Communication and Computing, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Constructions of Almost Resilient Functions

2005
The relation between almost resilient function and its component functions is investigated in this paper. We prove that if each nonzero linear combination of f1,f2,⋯,fm is an e-almost(n,1,k)-resilient function, then F=(f1,f2,⋯,fm) is a $\frac{2^{m}-1}{2^{m}-1}\epsilon$-almost(n,m,k)-resilient function.
Pin-Hui Ke, Tai-Lin Liu, Qiao-Yan Wen
openaire   +1 more source

Elliptic Curves and Resilient Functions

2001
In this paper, we propose a novel relationship between the correlation of two polynomial-type Boolean functions and the order of an associated algebraic curve. By this relationship, we propose a method to generate a resilient (correlation immune and balanced) function from a cubic polynomial.
Jung Hee Cheon, Seongtaek Chee
openaire   +1 more source

On construction of resilient functions

1996
An (n, m, t) resilient function is a function f: GF(2) n → GF(2) m such that every possible output m-tuple is equally likely to occur when the values of t arbitrary inputs are fixed by an opponent and the remaining n−t input bits are chosen independently at random.
Chuan-Kun Wu, Ed Dawson
openaire   +1 more source

Home - About - Disclaimer - Privacy