 |
Nikolay Kaleyski |
| Researcher | |
| Nikolay Kaleyski obtained a bachelor’s degree in General computer science in 2014 and a master’s degree in Theoretical computer science in 2016 from Charles University in Prague. His bachelor’s thesis, “Eigenvalues of symmetric interval matrices”, concerns the implementation of algorithms for computing the eigenvalues of symmetric interval matrices in Matlab, while his master’s thesis, “Boolean methods in knowledge compilation”, concerns the construction and analysis of a family of Boolean functions serving as a counter-example to an open problem in knowledge compilation. In 2021, he defended his PhD thesis Towards a deeper understanding of APN functions and related longstanding problems at the University of Bergen.
He joined the Boolean functions team as a PhD student in June 2017, and his current research focuses on the construction and analysis of almost perfect nonlinear (APN) as well as other optimal Boolean functions with applications to cryptography. |
|
| Contact Information | |
|
|