My research focuses on the analysis and construction of Boolean functions and other functions over finite fields and vector spaces with optimal cryptographic properties (APN functions, planar functions, and others). I am also interested in the design of algorithms for testing properties of such functions, and in efficient implementations of algorithms and search procedures.

Autumn 2024: INF249: Advanced Cybersecurity

Spring 2024: INF249: Advanced Cybersecurity

Spring 2023: INF143A: Applied Cryptography

Autumn 2022: INF242: Information Theory

Spring 2022: INF143A: Applied Cryptography

Autumn 2021: INF242: Information Theory

Autumn 2020: INF242: Information Theory

Autumn 2019: INF240A Basic Codes

Conference lecture

• Lilya Budaghyan; Nikolay Stoyanov Kaleyski; Soonhak Kwon et al. (2018). Partially APN Boolean functions. (external link)
• Lilya Budaghyan; Nikolay Stoyanov Kaleyski; Constanza Susana Riera et al. (2020). On the sensitivity of some permutation APN functions to swapping points. (external link)

Academic article

• Lilya Budaghyan; Ivana Ivkovic; Nikolay Stoyanov Kaleyski (2022). Triplicate functions. (external link)
• Lilya Budaghyan; Nikolay Stoyanov Kaleyski; Soonhak Kwon et al. (2019). Partially APN Boolean functions and classes of functions that are not APN infinitely often. (external link)
• Nikolay Stoyanov Kaleyski; Kjetil Amundsen Nesheim; Pantelimon Stănică (2023). An infinite family of 0-APN monomials with two parameters. (external link)
• Diana Davidova; Nikolay Stoyanov Kaleyski (2021). Generalization of a class of APN binomials to Gold-like functions. (external link)
• Nikolay Stoyanov Kaleyski (2021). Deciding EA-equivalence via invariants. (external link)
• Lilya Budaghyan; Claude Michael Carlet; Tor Helleseth et al. (2020). On the Distance Between APN Functions. (external link)
• Nikolay Stoyanov Kaleyski (2021). Invariants for EA- and CCZ-equivalence of APN and AB functions. (external link)
• Lilya Budaghyan; Nikolay Stoyanov Kaleyski; Constanza Susana Riera et al. (2020). Partially APN functions with APN-like polynomial representations. (external link)
• Yuyin Yu; Nikolay Stoyanov Kaleyski; Lilya Budaghyan et al. (2020). Classification of quadratic APN functions with coefficients in F2 for dimensions up to 9. (external link)
• Nikolay Stoyanov Kaleyski (2019). Changing APN functions at two points. (external link)
• Samuele Andreoli; Lilya Budaghyan; Robert Coulter et al. (2025). On a classification of planar functions in characteristic three. (external link)
• Lilya Budaghyan; Nikolay Stoyanov Kaleyski; Constanza Susana Riera et al. (2021). On the behavior of some APN permutations under swapping points. (external link)
• Lilya Budaghyan; Marco Calderini; Claude Michael Carlet et al. (2022). On Two Fundamental Problems on APN Power Functions. (external link)
• Lilya Budaghyan; Tor Helleseth; Nikolay Stoyanov Kaleyski (2020). A New Family of APN Quadrinomials. (external link)
• Lilya Budaghyan; José L. Imaña; Nikolay Stoyanov Kaleyski (2024). Low-Complexity Hardware Architecture of APN Permutations Using TU-Decomposition. (external link)
• Kangquan Li; Nikolay Stoyanov Kaleyski (2024). Two New Infinite Families of APN Functions in Trivariate Form. (external link)
• José L. Imaña; Nikolay Stoyanov Kaleyski; Lilya Budaghyan (2023). Hardware architecture of Dillon's APN permutation for different primitive polynomials. (external link)

Editorial/Leader article

• Lilya Budaghyan; Claude Michael Carlet; Tor Helleseth et al. (2024). Editorial: Special issue on Boolean functions and their applications 2023. (external link)

Doctoral thesis (PhD)

• Lilya Budaghyan; Nikolay Stoyanov Kaleyski (2021). Towards a deeper understanding of APN functions and related longstanding problems. (external link)

See a complete overview of publications in Cristin.