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

Yuriy V. Tarannikov

dblp:18/2405 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0003-2101-800XORCID · reported

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

Security and privacy · 4 · 2 first-author · 1 since 2021Theory of computation · 2

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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › boolean functions
correlation immunity
0.012001
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions · ASIACRYPT 2001
YearPublicationVenuePosition
2024 An asymptotic lower bound on the number of bent functions
Vladimir N. Potapov, Anna A. Taranenko, Yuriy V. Tarannikov
Des. Codes Cryptogr.3
2002 Covering Sequences of Boolean Functions and Their Cryptographic Significance
Claude Carlet, Yuriy V. Tarannikov
Des. Codes Cryptogr.2
2001 Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
Yuriy V. Tarannikov, Peter Korolev, Anton Botev
ASIACRYPT1
2001 New Constructions of Resilient Boolean Functions with Maximal Nonlinearity
Yuriy V. Tarannikov
FSE1
1999 On Repetition-Free Binary Words of Minimal Density
Roman Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov
Theor. Comput. Sci.3
1998 On Repetition-Free Binary Words of Minimal Density
Roman Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov
MFCS3