论文部分内容阅读
Solving Boolean equation systems plays a fundamental role in many important fields such as coding theory,cryptology,and analysis of computer hardware.To find efficient algorithms for solving Boolean equations and estimate their complexities are central issues in theoretic computer science.In this note,we will survey recent results on the complexity of using the approximate algorithm to solve Boolean equation systems and on new characteristic set algorithms for solving Boolean equation systems and their applications in cryptanalysis.
Solving Boolean equations systems plays a fundamental role in many important fields such as coding theory, cryptology, and analysis of computer hardware. To find efficient algorithms for solving Boolean equations and estimate their complexities are central issues in theoretic computer science. In this note, we will survey recent results on the complexity of using the approximate algorithm to solve Boolean equation systems and on new characteristic set algorithms for solving Boolean equation systems and their applications in cryptanalysis.