The link to download the data of the experiments discussed in Section 4
of [2] is the following:
https://lucamariot.org/files/datasets/dataset_tpnc_2015.zip
For each run, the fitness of the best solution found by the relevant heuristic
algorithm is reported. If the best solution is a Boolean function, then the
decimal representation of its truth table is given, which can be used to verify
its cryptographic properties with the program TestSingleBoolFunProp
(see attached
code). Otherwise, the decimal representation of the nearest Boolean function
is reported.
- 1
- Clark, J.A., Jacob, J., Maitra, S., Stanica, P.: Almost
Boolean Functions: The Design of Boolean Functions by Spectral
Inversion. Comput. Intell. 20(3):450-462 (2004)
- 2
- Mariot, L., Leporati, A.: A Genetic Algorithm for Evolving
Plateaued Cryptographic Boolean Functions. In: Dediu, A.-H.,
Magdalena, L., Martin-Vide, C. (eds.) Proceedings of TPNC 2015.
LNCS, vol. 9477, pp. 33-45. Springer (2015)
Generated using LaTeX2HTML - Luca Mariot (luca.mariot@disco.unimib.it)