Jeudi 06 novembre 2025, 14:00 à 15:00

salle de séminaire du département d'informatique

Kirpa Garg

(LITIS, université de Rouen-Normandie)

The notion of vanishing flats provides a combinatorial perspective on the planarity of cryptographic functions. The number of vanishing flats of a function serves as a quantitative measure of its distance from the set of Almost Perfect Nonlinear (APN) functions. Recently, the Feistel Boomerang Connectivity Table (FBCT) and the related concept of F-Boomerang uniformity have been introduced to further analyze cryptographic properties. In this talk, we establish a connection between these concepts and the notion of vanishing affine subspaces of dimension 2 in even characteristic.