default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolay S. Kaleyski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Lilya Budaghyan, Claude Carlet, Tor Helleseth, Nikolay S. Kaleyski, Sihem Mesnager:
Editorial: Special issue on Boolean functions and their applications 2023. Cryptogr. Commun. 16(6): 1183-1185 (2024)- [j15]Lilya Budaghyan, José Luis Imaña
, Nikolay S. Kaleyski:
Low-Complexity Hardware Architecture of APN Permutations Using TU-Decomposition. IEEE Trans. Circuits Syst. I Regul. Pap. 71(12): 6544-6554 (2024) - [j14]Kangquan Li, Nikolay S. Kaleyski:
Two New Infinite Families of APN Functions in Trivariate Form. IEEE Trans. Inf. Theory 70(2): 1436-1452 (2024) - [i14]Yuyin Yu, Jingchen Li, Nadiia Ichanska, Nikolay S. Kaleyski:
Construction of quadratic APN functions with coefficients in 픽2 in dimensions 10 and 11. IACR Cryptol. ePrint Arch. 2024: 1778 (2024) - [i13]Nadiia Ichanska, Simon Berg, Nikolay S. Kaleyski, Yuyin Yu:
Pushing the QAM method for finding APN functions further. IACR Cryptol. ePrint Arch. 2024: 1838 (2024) - 2023
- [j13]Lilya Budaghyan, Ivana Ivkovic, Nikolay S. Kaleyski:
Triplicate functions. Cryptogr. Commun. 15(1): 35-83 (2023) - [j12]Nikolay S. Kaleyski, Kjetil Nesheim, Pantelimon Stanica:
An infinite family of 0-APN monomials with two parameters. Cryptogr. Commun. 15(6): 1139-1169 (2023) - [j11]José Luis Imaña, Nikolay S. Kaleyski, Lilya Budaghyan:
Hardware architecture of Dillon's APN permutation for different primitive polynomials. Microprocess. Microsystems 103: 104945 (2023) - 2022
- [j10]Nikolay S. Kaleyski:
Deciding EA-equivalence via invariants. Cryptogr. Commun. 14(2): 271-290 (2022) - [j9]Lilya Budaghyan, Nikolay S. Kaleyski, Constanza Riera, Pantelimon Stanica:
On the behavior of some APN permutations under swapping points. Cryptogr. Commun. 14(2): 319-345 (2022) - [j8]Lilya Budaghyan, Marco Calderini, Claude Carlet, Diana Davidova, Nikolay S. Kaleyski:
On Two Fundamental Problems on APN Power Functions. IEEE Trans. Inf. Theory 68(5): 3389-3403 (2022) - [c3]José Luis Imaña, Lilya Budaghyan, Nikolay S. Kaleyski:
Decomposition of Dillon's APN Permutation with Efficient Hardware Implementation. WAIFI 2022: 250-268 - [i12]Nikolay S. Kaleyski, Kjetil Nesheim, Pantelimon Stanica:
A doubly-infinite family of 0-APN monomials. CoRR abs/2211.13485 (2022) - [i11]Ivana Ivkovic, Nikolay S. Kaleyski:
Deciding and reconstructing linear equivalence of uniformly distributed functions. IACR Cryptol. ePrint Arch. 2022: 666 (2022) - [i10]Diana Davidova, Nikolay S. Kaleyski:
Classification of all DO planar polynomials with prime field coefficients over GF(3^n) for n up to 7. IACR Cryptol. ePrint Arch. 2022: 1059 (2022) - [i9]Kangquan Li, Nikolay S. Kaleyski:
Two new infinite families of APN functions in triviariate form. IACR Cryptol. ePrint Arch. 2022: 1522 (2022) - 2021
- [j7]Nikolay S. Kaleyski:
Invariants for EA- and CCZ-equivalence of APN and AB functions. Cryptogr. Commun. 13(6): 995-1023 (2021) - [i8]Nikolay S. Kaleyski:
Invariants for EA- and CCZ-equivalence of APN and AB functions. IACR Cryptol. ePrint Arch. 2021: 300 (2021) - [i7]Lilya Budaghyan, Ivana Ivkovic, Nikolay S. Kaleyski:
Triplicate functions. IACR Cryptol. ePrint Arch. 2021: 1387 (2021) - 2020
- [j6]Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica:
Partially APN Boolean functions and classes of functions that are not APN infinitely often. Cryptogr. Commun. 12(3): 527-545 (2020) - [j5]Lilya Budaghyan, Nikolay S. Kaleyski, Constanza Riera, Pantelimon Stanica:
Partially APN functions with APN-like polynomial representations. Des. Codes Cryptogr. 88(6): 1159-1177 (2020) - [j4]Yuyin Yu, Nikolay S. Kaleyski, Lilya Budaghyan, Yongqiang Li:
Classification of quadratic APN functions with coefficients in F2 for dimensions up to 9. Finite Fields Their Appl. 68: 101733 (2020) - [j3]Lilya Budaghyan, Claude Carlet, Tor Helleseth, Nikolay S. Kaleyski:
On the Distance Between APN Functions. IEEE Trans. Inf. Theory 66(9): 5742-5753 (2020) - [j2]Lilya Budaghyan, Tor Helleseth, Nikolay S. Kaleyski:
A New Family of APN Quadrinomials. IEEE Trans. Inf. Theory 66(11): 7081-7087 (2020) - [c2]Diana Davidova, Nikolay S. Kaleyski:
Generalization of a Class of APN Binomials to Gold-Like Functions. WAIFI 2020: 195-206 - [i6]Lilya Budaghyan, Nikolay S. Kaleyski, Constanza Riera, Pantelimon Stanica:
On the sensitivity of some APN permutations to swapping points. IACR Cryptol. ePrint Arch. 2020: 557 (2020) - [i5]Lilya Budaghyan, Marco Calderini, Claude Carlet, Diana Davidova, Nikolay S. Kaleyski:
On two fundamental problems on APN power functions. IACR Cryptol. ePrint Arch. 2020: 1359 (2020)
2010 – 2019
- 2019
- [j1]Nikolay S. Kaleyski:
Changing APN functions at two points. Cryptogr. Commun. 11(6): 1165-1184 (2019) - [c1]Nikolay S. Kaleyski:
An Update on Known Invariants of Vectorial Boolean Functions. IWSDA 2019: 1-3 - [i4]Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica:
Partially APN Boolean functions and classes of functions that are not APN infinitely often. CoRR abs/1905.13025 (2019) - [i3]Lilya Budaghyan, Tor Helleseth, Nikolay S. Kaleyski:
A new family of APN quadrinomials. IACR Cryptol. ePrint Arch. 2019: 994 (2019) - [i2]Yuyin Yu, Nikolay S. Kaleyski, Lilya Budaghyan, Yongqiang Li:
Classification of quadratic APN functions with coefficients in GF(2) for dimensions up to 9. IACR Cryptol. ePrint Arch. 2019: 1491 (2019) - 2018
- [i1]Lilya Budaghyan, Claude Carlet, Tor Helleseth, Nikolay S. Kaleyski:
Changing Points in APN Functions. IACR Cryptol. ePrint Arch. 2018: 1217 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
