Research Article
New Results on Boolean Functions with High Nonlinearity and Low Transparency Order
Algorithm 1
Dual threshold algorithm for search excellent character Boolean function.
| Require: a random Boolean function | | Ensure: excellent character Boolean function | | | | | | | | whiledo | | whiledo | | | | //Use the array A_cost[] to record the cost value of each time | | end while | | Select the smallest cost value from A_cost[] and record it as | | //Update Boolean functions | | if, then | | | | //If the value of the times is equal to the times, the first double threshold counter plus 1 | | end if | | ifthen | | //The first threshold reset | | //Second threshold counter plus 1 | | end if | | if, then | | ifthen | | //The second threshold reset | | end if | | end if | | end while |
|