Program for
International Conference on
Boolean Functions:
Cryptography and Applications (BFCA)
 
Date: May 2 - 3, 2007, in Paris, France
BFCA'07
Wednesday, May 2nd Thursday, May 3rd
09h30-10h30 Welcome reception
Registration
P. Langevin
Checking the main conjectures related to the Walsh-Fourier Spectrum of Power functions.
10h30-10h45 Coffee Coffee break
10h45-11h00 G. McGuire
Discrete Mathematics, Coding and Cryptography at the Claude Shannon Institute
11h00-11h45 J.-J. Climent, F. García, V. Requena
Some Constructions of Bent Functions of n+2 Variables From Bent Function of n Variables
11h45-12h30 S. Guilley, P. Hoogvorst, R. Pacalet, J. Schmidt
Improving Side-Channel Attacks by Exploiting Substitution Boxes Properties
A. Doğanaksoy, E. Saygi, Z. Saygi
Quadratic Feedback Shift Registers Generating Maximum Length Sequences
12h30-14h00 Lunch Lunch
14h00-14h45 İ. Sertkaya, A. Doğanaksoy
Some Results on Nonlinearity Preserving Bijective Transformations
F. Armknecht, P.-L. Cayrel, P. Gaborit, O. Ruatta
Improved Algorithm to Find Equations for Algebraic Attacks for Combiners with Memory
14h45-15h15 Coffee break Coffee break
15h15-16h00 S. Kavut, M. Yücel, S. Maitra
Construction of Resilient Functions by the Concatenation of Boolean Functions Having nonintersecting Walsh Spectra
M.-A. Dias, J.-R. de Oliveira
An Inverter Architecture for ECC-GF(2m) Based on the Stein's Algorithm
16h00-16h45 S. Maitra, S. Sarkar, D.-K. Dalai
On Dihedral Group Invariant Boolean Functions
J. Pieprzyk, X.-M. Zhang
Computing Möbius Transforms of Boolean Functions and Characterizing Coincident Boolean Functions.