On pseudorandom subsets in finite fields I: measure of pseudorandomness and support of Boolean functions

Author(s):  
Huaning Liu ◽  
Xiaolin Chen
2015 ◽  
Vol 26 (05) ◽  
pp. 537-556 ◽  
Author(s):  
Xiwang Cao ◽  
Lei Hu

For cryptographic systems the method of confusion and diffusion is used as a fundamental technique to achieve security. Confusion is reflected in nonlinearity of certain Boolean functions describing the cryptographic transformation. In this paper, we present two Boolean functions which have low Walsh spectra and high nonlinearity. In the proof of the nonlinearity, a new method for evaluating some exponential sums over finite fields is provided.


10.37236/4072 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Alexander Pott ◽  
Kai-Uwe Schmidt ◽  
Yue Zhou

Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $X$ be a set of matrices over $\mathbb{F}_q$. The main results of this paper are explicit expressions for the number of pairs $(A,B)$ of matrices in $X$ such that $A$ has rank $r$, $B$ has rank $s$, and $A+B$ has rank $k$ in the cases that (i) $X$ is the set of alternating matrices over $\mathbb{F}_q$ and (ii) $X$ is the set of symmetric matrices over $\mathbb{F}_q$ for odd $q$. Our motivation to study these sets comes from their relationships to quadratic forms. As one application, we obtain the number of quadratic Boolean functions that are simultaneously bent and negabent, which solves a problem due to Parker and Pott.


2011 ◽  
Vol 159 (11) ◽  
pp. 1059-1069 ◽  
Author(s):  
David Canright ◽  
Sugata Gangopadhyay ◽  
Subhamoy Maitra ◽  
Pantelimon Stănică

2017 ◽  
Vol 46 ◽  
pp. 163-178 ◽  
Author(s):  
Nurdagül Anbar ◽  
Wilfried Meidl

Sign in / Sign up

Export Citation Format

Share Document