Research
My main research interests are Boolean functions used in cryptography and its connections to coding theory, combinatorics and other areas. In particular, I focus on cryptographically optimal functions such as almost perfect nonlinear (APN) functions and their connection to Sidon sets.
Publications and preprints
- Ingo Czerwinski, Alexander Pott. Sidon sets, sum-free sets and linear codes. Advances in Mathematics of Communications, 2024, 18(2): 549-566. doi: 10.3934/amc.2023054, pre-print
- Ingo Czerwinski: On the minimal value set size of APN functions, 2020. pre-print
Reviewed abstracts
- Ingo Czerwinski, Alexander Pott. Sidon sets, sum-free sets and linear codes. ALCOCRYPT, ALgebraic and combinatorial methods for COding and CRYPTography, 20.-24.2.2023, CIRM, Marseille, France.
Talks
- ALCOCRYPT, ALgebraic and combinatorial methods for COding and CRYPTography, 20.-24.2.2023, CIRM, Marseille, France: Sidon sets, sum-free sets and linear codes.