◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nikolay S. Kaleyski

3 papers hereh-index 8172 citations37 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author2

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.IT1
  • math.CO1
  • math.NT1

identity via Semantic Scholar / OpenAlex

activity
20192024
most citedPartially APN Boolean functions and classes of functions that are not APN infinitely often

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2024

On a classification of planar functions in characteristic three

Samuele Andreoli, Lilya Budaghyan, Robert Coulter +3

Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, proj…

math.NT2022

An infinite family of 0-APN monomials with two parameters

Nikolay Kaleyski, Kjetil Nesheim, Patenlimon Stănică

We consider an infinite family of exponents e(l,k) with two parameters, l and k, and derive sufficient conditions for e(l,k) to be 0-APN over F2n​. These cond…

cs.IT2019★ 1 cited

Partially APN Boolean functions and classes of functions that are not APN infinitely often

Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon +2

In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion t…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.