Professional Documents
Culture Documents
Farland
Fun
tions
Yuliang Zheng
S
hool of Network Computing
Monash University
M
Mahons Road, Frankston, VIC 3199, Australia
Email: yuliang.zhenginfote
h.monash.edu.au
Xian-Mo Zhang
S
hool of Information Te
hnology & Computer S
ien
e
University of Wollongong
Wollongong, NSW 2522, Australia
Email: xianmo
s.uow.edu.au
Abstra
t
Maiorana-M
Farland fun
tions were originally introdu
ed in
ombinatori
s. These fun
tions are useful in
onstru
ting bent fun
tions,
although only in spe
ial
ases. An interesting problem is therefore
to investigate whether Maiorana-M
Farland fun
tions that are not
bent
an be used, indire
tly, to obtain bent fun
tions. This question
is given an armative answer in this paper. More spe
i
ally, we
show that the non-zero terms in the Fourier transform of a MaioranaM
Farland fun
tion that is asso
iated with an one-to-one mapping,
an be used to form the sequen
e of a bent fun
tion. This result
presents new insights into the usefulness and properties of MaioranaM
Farland fun
tions.
Key Words
Motivation
Let Vn be the ve
tor spa
e of n tuples of elements from GF (2). For positive
integers k and m, let Q be a mapping from Vk to Vm and r be a (Boolean)
fun
tion on Vk . Dene a fun
tion f (y; x) on Vm+k as
f (y; x) = Q(y)xT
r(y)
1)
);
f (z ) = f (y; x) = Q(y)xT
r(y)
(1)
(2)
Maiorana-M
Farland fun
tions play an important role in the
onstru
tion
of bent fun
tions, as well as in the design of
ryptographi
fun
tions that
satisfy
ryptographi
ally desirable properties. We are parti
ularly interested in the
ase when m = k and Q is a permutation on Vk . For the
sake of
onvenien
e, we use P to denote the permutation on Vk . Then the
Maiorana-M
Farland fun
tion introdu
ed in (1)
an be spe
ialized as
f (z ) = f (y; x) = P (y)xT
4
r(y)
(3)
r(x)
(4)
Notation 1 Let
2k denote the set of bent fun
tions on V2k expressed in
(3), and similarly let 2k denote the set of bent fun
tions on V2k expressed
in (4).
Then one
an verify that f 2
2k \ 2k if and only if f (y; x) = xyT ,
where x; y 2 V2k . Hen
e we have #(
2k \ 2k ) = 1. In addition, we
k
have #
2k = # 2k = (2k !)22 . Thus (3) and (4) allow us to
onstru
t
exponentially many bent fun
tions all of whi
h, ex
ept f (y; x) = xyT , are
distin
t.
We note that by the use of nonsingular linear transformations on the
variables, a further greater number of bent fun
tions
an be obtained from
those in
2k and 2k . Nevertheless, it is important to point out that there
exist bent fun
tions that are neither in
2k or 2k , nor
an they be obtained
by applying a nonsingular linear transformation on the variables of bent
fun
tions in
2k or 2k (see [5).
To prove the main result in this paper, we examine in more detail the
sequen
e of f in (4).
1)
(5)
Set
= (0 ; 1 ; ; 2k 1 );
5
(6)
(7)
Hen
e we have 2k 2k .
0
k
Finally, it is easy to verify that # 2k = # 2k = 2k ! 22 . This property,
0
0
together with the fa
t that 2k 2k , shows that 2k = 2k is indeed true.
Thus we have proved the following result:
f (z ) = f (y; x) = F (y)xT
r(y)
Li+2m
..
.
Hk `i = 6
6
4
Li
Li+2m (2k
7
7
7
5
1)
for ea
h xed i, 0 i 2m 1.
As in Se
tion 3, we denote by hij the entry on the
ross of the ith row
and the j th
olumn of Hk , where i; j = 0; 1; : : : ; 2k 1, and denote by hi
the ith row of Hk , i.e., hi = (hi0 ; hi1 ; : : : ; hi2k 1 ). Then we have
(hs Hk ) `i =
2k
X1
u=0
hsu Li+u2m
(8)
(9)
where ea
h 0 denotes the all-zero sequen
e of length 2m and the sth sequen
e of length 2m is `i . Comparing (9) and (8), we
on
lude
(0; : : : ; 0; `i; 0; : : : ; 0) = 2
2k
X1
u=0
hsu Li+u2m
and hen e
k 1
k 1
2X
2X
= 2 k (
0
h0u Lj0 +u2m ;
1
h1u Lj1 +u2m ; : : :
u=0
: : : ; 2k
2k
u=0
u=0
h2k 1u Lj2k
m
1+ 2
(10)
r(y)
As a onsequen e, we have
Con lusions
A knowledgement
Referen es
[1 P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On
orrelationimmune fun
tions. In Advan
es in Cryptology - CRYPTO'91, volume
576 of Le
ture Notes in Computer S
ien
e, pages 87{100. SpringerVerlag, Berlin, Heidelberg, New York, 1991.
[2 C. Carlet and P. Codes. More
orrelation-immune and resilient fun
tions over Galois elds and Galois ring. In Advan
es in Cryptology EUROCRYPT'98, volume 1233 of Le
ture Notes in Computer S
ien
e,
pages 422{433. Springer-Verlag, Berlin, Heidelberg, New York, 1997.
[3 J. F. Dillon. A survey of bent fun
tions. The NSA Te
hni
al Journal,
pages 191{215, 1972. (un
lassied).
[4 J. F. Dillon. Elementary Hadamard Dieren
e Sets. Ph.D. dissertation,
University of Maryland, 1974.
[5 J. F. Dillon. Elementary Hadamard dieren
e sets. In Pro
eeding of the
Sixth Southeastern Conferen
e on Combinatori
s, Graph Theory, and
Computing, pages 237{249, 1975.
[6 O. S. Rothaus. On \bent" fun
tions. Journal of Combinatorial Theory,
Ser. A, 20:300{305, 1976.
[7 J. Seberry, X. M. Zhang, and Y. Zheng. On
onstru
tions and nonlinearity of
orrelation immune fun
tions. In Advan
es in Cryptology EUROCRYPT'93, volume 765 of Le
ture Notes in Computer S
ien
e,
pages 181{199. Springer-Verlag, Berlin, Heidelberg, New York, 1994.
[8 J. Seberry, X. M. Zhang, and Y. Zheng. Nonlinearity and propagation
hara
teristi
s of balan
ed boolean fun
tions. Information and Computation, 119(1):1{13, 1995.
[9 R. Yarlagadda and J. E. Hershey. Analysis and synthesis of bent sequen
es. IEE Pro
eedings (Part E), 136:112{123, 1989.
10