Geodesic

Tome (2021) no. 14

Sommaire

Воспоминания коллег и учеников о Геннадии Петровиче Агибалове
p. 6-23
On construction of maximal genus $3$ hyperelliptic curves
p. 24-30
Central limit theorem for $U$-statistics of tuples of vertex labels on a complete graph
p. 30-32
On the largest order of substitutions of a given degree
p. 32-36
Hybrid approach to the search for Boolean functions with high algebraic immunity based on heuristics
p. 37-40
$\mathrm{S}$-blocks with maximum component algebraic immunity on a small number of variables
p. 40-42
On some properties of self-dual generalized bent functions
p. 42-45
On properties of additive differential probabilities of XOR
p. 46-48
Improved estimates for the number of $(n, m, k)$-resilient and correlation-immune Boolean mappings
p. 48-51
On the way of constructing differentially $2\delta$-uniform permutations over $\mathbb{F}_{2^{2m}}$
p. 51-55
A conditions for uniqueness reresentation of $p$-logic function into disjunctive product of functions
p. 55-57
On derivatives of Boolean bent functions
p. 57-58
XS-circuits: hiding round oracles
p. 59-61
Development and analysis of oracle for the hibrid attack on a cryptographic system NTRU using a quantum search algorithm
p. 62-67
Cryptanalytic invertibility of two-argument functions
p. 67-71
Experimental study of the characteristics of one method of integrity checking of large volume data storage
p. 71-74
On the padding algorithm of large-sized blocks in integrity control systems
p. 74-79
Threshold Diffie — Hellman Protocol
p. 79-81
WireGuard protocol with GOST cipher suites
p. 81-84
Algebraic cryptanalysis of round-reduced lightweight ciphers Simon and Speck
p. 84-91
To the task of description minimal by inclusion perfect ciphers
p. 91-95
Post-quantum lattice-based e-voting for multiple candidates
p. 95-100
On ARX-like ciphers based on different codings of $2$-groups with a cyclic subgroup of index $2$
p. 100-104
Generating additional constraints in algebraic cryptanalysis using SAT oracles
p. 104-110
Choosing parameters for one $\mathrm{IND}$-$\mathrm{CCA2}$ secure McEliece modification in the standard model
p. 110-114
An improvement of cryptographic schemes based on the conjugacy search problem
p. 114-118
On privacy in decentralized systems with tokens
p. 119-125
About methods of developing consistent description of the MROSL DP-model for OS and DBMS for its verification with Rodin and ProB tools
p. 126-132
zk-SNARK-based data privacy method
p. 132-134
Control Flow Flattening deobfuscation using symbolic execution
p. 134-138
Application of x86 extensions for code protection
p. 138-140
Extended grammar-based fuzzing algorithm for JavaScript Engines
p. 140-146
Extension and analysis of information hiding method Deep Steganography
p. 146-148
Adaptation of the Rosenblatt — Parzen method for the experimental evaluation of the computing system reliability
p. 148-153
Bases over the field $\mathrm{GF(2)}$ generated by the Schur — Hadamard operation
p. 154-158
On decomposability of Schur — Hadamard product of the tensor products sum of Reed — Muller codes
p. 158-161
Regular vertex $1$-extension for $2$-dimension meshes
p. 161-163
On attractors in one discrete binary dynamic system with bipartite dependency graph
p. 163-165
Schemes for constructing minimal vertex $1$-extensions of complete bicolored graphs
p. 165-168
Towards the security of McEliece's cryptosystem based on Hermitian subfield subcodes
p. 168-175
On a solution of polynomial grammars and the general algebraic equation
p. 176-178
On generic complexity of the isomorphism problem for finite semigroups
p. 178-180
On a heuristic approach to constructing bijective vector Boolean functions with given cryptographic properties
p. 181-184
Some subgroups of the Burnside group $B_0(2,5)$
p. 184-186
DPLL-like satisfiability problem solver over the system of ANF equations
p. 187-190