A greedy algorithm for checking normality of cryptographic boolean functions

Nicholas Kolokotronis, Konstantinos Limniotis. A greedy algorithm for checking normality of cryptographic boolean functions. In Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012. pages 601-605, IEEE, 2012. [doi]

@inproceedings{KolokotronisL12a,
  title = {A greedy algorithm for checking normality of cryptographic boolean functions},
  author = {Nicholas Kolokotronis and Konstantinos Limniotis},
  year = {2012},
  url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6401008},
  researchr = {https://researchr.org/publication/KolokotronisL12a},
  cites = {0},
  citedby = {0},
  pages = {601-605},
  booktitle = {Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012},
  publisher = {IEEE},
  isbn = {978-1-4673-2521-9},
}