The purpose of this paper is to provide the general method for the solution of the Boolean function's primary function, and its application in encryption systems.
In the Boolean function theory, there is always a lack in the general method for the solution of primary function. This paper uses a very useful tool – e‐derivative, and by the help of this tool, obtains some very useful theorems.
The paper not only finds the method of solving the primary function of the Boolean function but also provides its application in encryption systems.
The Boolean function's primary function is also very useful in the detection of circuitry, not introduced in this paper.
This paper is very useful for information security.
The paper solves the initial‐value problem of the Boolean function's primary function, and constructs some Boolean functions with many cryptographical characters which are very useful in encryption systems.
