Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kanat S. Abdukhalikov

dblp:177/9468 · also Kanat Abdukhalikov · DBLP profile ↗
← Back
10ranked-venue papers
10as first author
6since 2021 · last 2026
0000-0003-0670-1361ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 7 · 7 first-author · 5 since 2021Artificial intelligence and machine learning · 2 · 2 first-authorTheory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › boolean functions
bent functions
0.512021
Cyclic Bent Functions and Their Applications in Sequences · IEEE Trans. Inf. Theory 2021
Coding theory › sequences
sequence design
0.512021
Cyclic Bent Functions and Their Applications in Sequences · IEEE Trans. Inf. Theory 2021
Cryptographic primitives and cryptanalysis › boolean functions
bent functions
0.112021
Cyclic Bent Functions and Their Applications in Sequences · IEEE Trans. Inf. Theory 2021
Cryptographic primitives and cryptanalysis
boolean functions
0.112021
Cyclic Bent Functions and Their Applications in Sequences · IEEE Trans. Inf. Theory 2021

Methods — techniques the papers use, named apart from their topics

prequasifield construction · 1.0kantor-williams prequasifields · 1.0
YearPublicationVenuePosition
2026 Two families of linear codes containing non-GRS MDS codes
Kanat S. Abdukhalikov, Gyanendra K. Verma 0002
Des. Codes Cryptogr.1
2025 Ovoids in the cyclic presentation of rmPG(3, q )
abstract
Abstract We consider the cyclic presentation of $$\textrm{PG}(3, q )$$ PG ( 3 , q ) whose points are in the finite field $$\mathbb {F}_{q^4}$$ F q 4 and describe the known ovoids therein. We revisit the set $$\mathcal {O}$$ O , consisting of $$(q^2+1)$$ ( q 2 + 1 ) th roots of unity in $$\mathbb {F}_{q^4}$$ F q 4 , and prove that it forms an elliptic quadric within the cyclic presentation of $$\textrm{PG}(3, q )$$ PG ( 3 , q ) . Additionally, following the work of Glauberman on Suzuki groups, we offer a new description of Suzuki–Tits ovoids in the cyclic presentation of $$\textrm{PG}(3, q )$$ PG ( 3 , q ) , characterizing them as the zeroes of a polynomial over $$\mathbb {F}_{q^4}$$ F q 4 .
Kanat S. Abdukhalikov, Simeon Ball, Duy Ho, Tabriz Popatia
Des. Codes Cryptogr.1
2025 Linear codes from arcs and quadrics
Kanat S. Abdukhalikov, Duy Ho
Des. Codes Cryptogr.1
2021 Equivalence classes of Niho bent functions
Kanat S. Abdukhalikov
Des. Codes Cryptogr.1
2021 Extended cyclic codes, maximal arcs and ovoids
Kanat S. Abdukhalikov, Duy Ho
Des. Codes Cryptogr.1
2021 Cyclic Bent Functions and Their Applications in Sequences
abstract
Let m be an even positive integer. A Boolean bent function f on F(2m-1)×F2is called a cyclic bent function if for any a≠b∈F(2m-1) and ε∈F2, f( ax1,x2)+f( bx1,x2+ε) is always bent, where x1∈F(2m-1),x2∈F2. Cyclic bent functions look extremely rare. This paper focuses on cyclic bent functions on F(2m-1)×F2and their applications. The first objective of this paper is to establish a link between quadratic cyclic bent functions and a special type of prequasifields, and construct a class of quadratic cyclic bent functions from the Kantor-Williams prequasifields. The second objective is to use cyclic bent functions to construct families of optimal sequences. The results of this paper show that cyclic bent functions have nice applications in several fields such as coding theory, symmetric cryptography, and CDMA communication.
Kanat S. Abdukhalikov, Cunsheng Ding, Sihem Mesnager, Chunming Tang 0001, Maosheng Xiong
IEEE Trans. Inf. Theory1
2001 Affine Invariant and Cyclic Codes over -adic Numbers and Finite Rings
Kanat S. Abdukhalikov
Des. Codes Cryptogr.1
1998 On the Security of the Hashing Scheme Based on SL2
Kanat S. Abdukhalikov, Chul Kim
FSE1
1998 On fuzzy subalgebras
Kanat S. Abdukhalikov, M. S. Tulenbaev, Ualbai Umirbaev
Fuzzy Sets Syst.1
1996 The dual of a fuzzy subspace
Kanat S. Abdukhalikov
Fuzzy Sets Syst.1