Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Cheremushkin, Aleksandr Vasil'evich
Statistics
Total publications: 40
Scientific articles: 40
Presentations: 2

Number of views:
This page:4213
Abstract pages:20285
Full texts:11167
References:2788
Professor
Doctor of physico-mathematical sciences
E-mail:

https://www.mathnet.ru/eng/person27899
List of publications on Google Scholar
https://mathscinet.ams.org/mathscinet/MRAuthorID/253445

Publications in Math-Net.Ru Citations
2025
1. A. V. Cheremushkin, “General scheme for a class of Diffie — Hellman type protocols”, Prikl. Diskr. Mat., 2025, no. 69,  94–110  mathnet
2. A. V. Cheremushkin, “A construction of Diffie — Hellman protocol with noncommutative operations”, Prikl. Diskr. Mat. Suppl., 2025, no. 18,  178–182  mathnet
2024
3. A. V. Cheremushkin, “Paramedial strong dependance $n$-ary operations”, Diskr. Mat., 36:3 (2024),  115–126  mathnet 1
4. A. V. Cheremushkin, “Medial and paramedial general identities for strong dependance operations”, Prikl. Diskr. Mat., 2024, no. 65,  21–40  mathnet 3
5. A. V. Cheremushkin, “Medial and paramedial alebras with strong dependable operations”, Prikl. Diskr. Mat. Suppl., 2024, no. 17,  19–23  mathnet
2023
6. A. V. Cheremushkin, “A functional identity of generalized transitivity for strongly dependent $n$-ary operations”, Diskr. Mat., 35:4 (2023),  146–156  mathnet
7. A. V. Cheremushkin, “ID-based public key cryptographic systems”, Prikl. Diskr. Mat., 2023, no. 61,  44–85  mathnet
2022
8. A. V. Cheremushkin, “On the linear disjunctive decomposition of a $p$-logic function into a sum of functions”, Diskr. Mat., 34:4 (2022),  99–107  mathnet; Discrete Math. Appl., 35:2 (2025), 85–91
9. P. A. Polyschuk, A. V. Cheremushkin, “A randomized analog of Chaum — van Antwerpen undeniable signature”, Prikl. Diskr. Mat., 2022, no. 57,  40–51  mathnet  mathscinet
2021
10. A. V. Cheremushkin, “On the linear disjunctive decomposition of a $p$-logic function into a product of functions”, Diskr. Mat., 33:4 (2021),  153–171  mathnet; Discrete Math. Appl., 35:1 (2025), 1–14 1
11. A. V. Cheremushkin, “A conditions for uniqueness reresentation of $p$-logic function into disjunctive product of functions”, Prikl. Diskr. Mat. Suppl., 2021, no. 14,  55–57  mathnet
2020
12. A. V. Cheremushkin, “A letter to the Editor”, Diskr. Mat., 32:3 (2020),  147  mathnet  mathscinet
13. A. V. Cheremushkin, “Medial strong dependance $n$-ary operations”, Diskr. Mat., 32:2 (2020),  112–121  mathnet  mathscinet 3
14. A. V. Cheremushkin, “Selfish mining strategy elaboration”, Prikl. Diskr. Mat., 2020, no. 49,  57–77  mathnet 2
15. A. V. Cheremushkin, “Elaboration of selfish-mine strategy”, Prikl. Diskr. Mat. Suppl., 2020, no. 13,  71–77  mathnet
16. A. V. Cheremushkin, “Partially invertible strongly dependent $n$-ary operations”, Mat. Sb., 211:2 (2020),  141–158  mathnet  mathscinet  zmath  elib; Sb. Math., 211:2 (2020), 291–308  isi  scopus 8
2019
17. A. V. Cheremushkin, “Medial strongly dependent $n$-ary operations”, Diskr. Mat., 31:2 (2019),  152–157  mathnet  mathscinet  elib; Discrete Math. Appl., 31:4 (2021), 251–258  isi  scopus 6
18. A. V. Cheremushkin, “Properties of strong dependance $n$-ary semigroups”, Prikl. Diskr. Mat. Suppl., 2019, no. 12,  36–41  mathnet  elib
2018
19. A. V. Cheremushkin, “Analogues of Gluskin–Hosszú and Malyshev theorems for strongly dependent $n$-ary operations”, Diskr. Mat., 30:2 (2018),  138–147  mathnet  mathscinet  elib; Discrete Math. Appl., 29:5 (2019), 295–302  isi  scopus 10
20. A. V. Cheremushkin, “Linear decomposition of Boolean functions into a sum or a product of components”, Prikl. Diskr. Mat., 2018, no. 40,  10–22  mathnet  elib 1
21. A. V. Cheremushkin, “An extension of Gluskin–Hoszu's and Malyshev's theorems to strong dependent $n$-ary operations”, Prikl. Diskr. Mat. Suppl., 2018, no. 11,  23–25  mathnet  elib
2017
22. A. V. Cheremushkin, “Estimating the level of affinity of a quadratic form”, Diskr. Mat., 29:1 (2017),  114–125  mathnet  elib; Discrete Math. Appl., 27:6 (2017), 339–347  isi  scopus 1
23. A. V. Cheremushkin, “On the rank of random quadratic form over finite field”, Prikl. Diskr. Mat., 2017, no. 35,  29–37  mathnet 1
24. A. V. Cheremushkin, “A condition for uniqueness of linear decomposition of a Boolean function into disjunctive sum of indecomposable functions”, Prikl. Diskr. Mat. Suppl., 2017, no. 10,  55–56  mathnet 2
2016
25. A. V. Cheremushkin, “On linear decomposition of Boolean functions”, Prikl. Diskr. Mat., 2016, no. 1(31),  46–56  mathnet 3
26. A. V. Cheremushkin, “On quadratic form rank distribution and asymptotic bounds of affinity level”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  36–38  mathnet
2015
27. A. V. Cheremushkin, “Enumeration of Boolean functions with a fixed number of affine products”, Prikl. Diskr. Mat. Suppl., 2015, no. 8,  43–47  mathnet
2014
28. A. V. Cheremushkin, “Computation of nonlinearity degree for discrete functions on primary cyclic groups”, Prikl. Diskr. Mat., 2014, no. 2(24),  37–47  mathnet 2
29. A. V. Cheremushkin, “Number of discrete functions on a primary cyclic group with a given nonlinearity degree”, Prikl. Diskr. Mat. Suppl., 2014, no. 7,  31–32  mathnet
2013
30. A. V. Cheremushkin, “An additive approach to nonlinearity degree of discrete functions on a primary cyclic group”, Prikl. Diskr. Mat., 2013, no. 2(20),  26–38  mathnet 7
31. A. V. Cheremushkin, “On a nonlinearity degree definition for a discrete function on a cyclic group”, Prikl. Diskr. Mat. Suppl., 2013, no. 6,  26–27  mathnet
2012
32. A. V. Cheremushkin, “On the notion of electronic signature”, Prikl. Diskr. Mat., 2012, no. 3(17),  53–69  mathnet 2
2010
33. A. V. Cheremushkin, “An additive approach to nonlinear degree of discrete function”, Prikl. Diskr. Mat., 2010, no. 2(8),  22–33  mathnet 16
2009
34. A. V. Cheremushkin, “Cryptographic protocols”, Prikl. Diskr. Mat., 2009, no. supplement № 2,  115–150  mathnet 5
35. A. V. Cheremushkin, “Protocol verification tools”, Prikl. Diskr. Mat., 2009, no. supplement № 1,  34–36  mathnet 1
36. A. V. Cheremushkin, “A recursive algorithm for cover-free family construction”, Prikl. Diskr. Mat., 2009, no. 4(6),  51–55  mathnet
37. A. V. Cheremushkin, “Almost all Latin squares have trivial autoparatopy group”, Prikl. Diskr. Mat., 2009, no. 3(5),  29–32  mathnet 2
2008
38. A. V. Cheremushkin, “Combinatorial-geometric technique to design a key distribution patterns (an overview)”, Prikl. Diskr. Mat., 2008, no. 1(1),  55–63  mathnet 2
2004
39. A. V. Cheremushkin, “Repetition-free decomposition of strongly dependent functions”, Diskr. Mat., 16:3 (2004),  3–42  mathnet  mathscinet  zmath; Discrete Math. Appl., 14:5 (2004), 439–478 11
2001
40. A. V. Cheremushkin, “Methods of affine and linear classification of binary functions”, Tr. Diskr. Mat., 4 (2001),  273–314  mathnet 13

Presentations in Math-Net.Ru
1. Аналоги теорем Белоусова, Глускина-Хоссу и Малышева для  $n$-арных  сильно зависимых операций
A. V. Cheremushkin
Research Seminar of the Department of Higher Algebra MSU
November 19, 2018 16:45
2. Декомпозиция и классификация дискретных функций
A. V. Cheremushkin
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
April 19, 2005

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026