|
|
Publications in Math-Net.Ru
-
Hadamard closure of general Reed–Solomon codes and filtration attack on the original Niederreiter cryptosystem
Diskr. Mat., 37:1 (2025), 130–150
-
A non-asymptotic estimate of the probability that a Shur — Hadamard square of long random linear code has a maximum dimension
Prikl. Diskr. Mat., 2025, no. 68, 56–70
-
Hadamard square of series connected linear codes
Diskr. Mat., 35:3 (2023), 100–124
-
Hadamard square of linear codes and the generalized minimal distance of Reed–Muller code of order 2
Diskr. Mat., 35:1 (2023), 128–152
-
The security of the code-based signature scheme based on the Stern identification protocol
Prikl. Diskr. Mat., 2022, no. 57, 67–90
-
Classification of Hadamard productsof one-codimensional subcodesof Reed–Muller codes
Diskr. Mat., 32:1 (2020), 115–134
-
SDN load balancing on L3-VPN gateways in data centers interconnection
Sistemy i Sredstva Inform., 28:1 (2018), 139–155
-
SDN load balancing for secure networks
Sistemy i Sredstva Inform., 28:1 (2018), 123–138
-
Cryptanalysis of the McEliece PKC based on $(k-1)$-Reed–Muller subcodes
Prikl. Diskr. Mat. Suppl., 2016, no. 9, 73–75
-
Effective attack on the McEliece cryptosystem based on Reed–Muller codes
Diskr. Mat., 26:1 (2014), 10–20
-
The failure of McEliece PKC based on Reed–Muller codes
Prikl. Diskr. Mat. Suppl., 2013, no. 6, 48–49
-
Algorithm for recovering plaintext from ciphertext in McEliece cryptosystem
Prikl. Diskr. Mat. Suppl., 2013, no. 6, 32–33
-
The relationship between structure of the key space and hardness of the McEliece–Sidelnikov Public Key Cryptosystem
Prikl. Diskr. Mat., 2010, no. supplement № 3, 34–35
-
The key space of the McEliece–Sidelnikov cryptosystem
Diskr. Mat., 21:3 (2009), 132–159
-
The generalized automorphisms of Reed-Muller code and McEliece–Sidelnikov public key cryptosystem
Prikl. Diskr. Mat., 2009, no. supplement № 1, 36–37
© , 2026