The problem of finding roots in large systems of logical equations each of
which includes restricted number of variables is considered. A new method b
ased on vector representation of regarded Boolean functions and their local
reduction is suggested for its solution. The proposed method was applied t
o one cryptanalytical problem reduced to solving a system with 131 unknowns
, and the result witnessed its very high efficiency.