| Tuesday | |||
| 09:00-09:45 | Kaisa Nyberg | Linear and statistical independence of linear approximations | (Slides) |
| 09:45-10:30 | Marco Calderini | On APN permutations | (Slides) |
| 11:00-11:45 | Léo Perrin | On S-box reverse-engineering: from cryptanalysis to the big APN problem | (Slides) |
| 11:45-12:05 | Stjepan Picek | On the S-boxes generated via cellular automata rules | (Slides) |
| 12:05-12:30 | Valeriya Idrisova | On APN functions EA-equivalent to permutations | (Slides) |
| 14:00-14:45 | Claude Carlet | On the possible exponents of APN power functions and their relation with Sidon sets and sum-free sets | (Slides) |
| 14:45-15:30 | Pierrick Meaux | Symmetric encryption scheme adapted to fully homomorphic encryption scheme: new criteria for Boolean functions | (Slides) |
| 16:00-16:20 | Xi Chen | Investigating the CCZ-equivalence between functions with low differential uniformity by projected differential spectrum | (Slides) |
| 16:20-16:40 | Irene Villa | On some properties of quadratic APN functions of a special form | (Slides) |
| 16:40-17:00 | Bo Sun | Quadratic APN polynomials in few terms in small dimensions | (Slides) |
| 17:00-17:45 | Anne Canteaut | Proving resistance of a block cipher against invariant attacks | (Slides) |
| Wednesday | |||
| 09:00-09:45 | Pante Stanica | (Generalized) Boolean functions: invariance under some groups of transformations and differential properties | (Slides) |
| 09:45-10:30 | Yue Zhou | Rank metric codes and related structures | (Slides) |
| 11:00-11:45 | Patrick Solé | Orthogonal group and Boolean functions | (Slides) |
| 11:45-12:05 | Bimal Mandal | New classes of generalized bent functions | (Slides) |
| 12:05-12:30 | Wilfried Meidl | Generalized bent functions from spreads and their spectra | (Slides) |
| 14:00-14:45 | Sihem Mesnager | Generalized plateaued functions and admissible (plateaued) functions | (Slides) |
| 14:45-15:30 | Nian Li | Some recent progress in the applications of Niho exponents | (Slides) |
| 16:00-16:20 | Yi Lu | Efficient numerical approximation of the DMC channel capacity | (Slides) |
| 16:20-16:40 | Meltem S. Turan | On the multiplicative complexity of 6-variable Boolean functions | (Slides) |
| 16:40-17:00 | Bjørn M. Greve | Solving polynomial systems over Boolean rings by elimination of variables | (Slides) |
| 17:00-17:45 | Natalia Tokareva | On structural properties of the class of bent functions | (Slides) |
| Friday | |||
| 09:00-09:45 | Alexander Pott | Duality of bent functions in odd characteristic | (Slides) |
| 09:45-10:30 | Alla Levina | Wavelets transformation and its applications in information security | (Slides) |
| 11:00-11:45 | Chunlei Li | On the periodic sequences with maximal nonlinear complexity | (Slides) |
| 11:45-12:05 | Nikolay S. Kaleyski | PI is not at least as succinct as MODS | (Slides) |
| 12:05-12:30 | Fuad Hamidli | On alltop functions | (Slides) |
| 14:00-14:45 | Ashley Montanaro | Boolean functions in quantum computation | (Slides) |
| 14:45-15:30 | Matthew G. Parker | Boolean functions in a message-passing, quantum, and machine learning context | (Slides) |
| 16:00-16:20 | Joan Boyar | Low-depth, low-size circuits for cryptographic applications | (Slides) |
| 16:20-16:40 | Stian Fauskanger | Separable statistics and multivariate linear cryptanalysis | (Slides) |
