3 papers
cs.CR2026
On a necessary condition for the matching cryptosystem stability
Aleksey Bolotnikov, Anwar Irmatov
The article contains a description of a possible attack on a matching cryptosystem and a defense with limited noise. A public key of a matching cryposystem consists of a graph and…
math.CO2024
On the matching arrangement of a graph, improper weight function problem and its application
Aleksey Bolotnikov, Anwar Irmatov
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight func…
math.CO2022
On a matching arrangement of a graph and LP-orientations of a matching polyhedron
Aleksey Bolotnikov
This paper contains a description of a connection between the matching arrangement and the matching polyhedron. A bijection between regions of the matching arragement and LP-orient…