Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 959617, 8 pages
http://dx.doi.org/10.1155/2015/959617
Research Article

On Negabent Functions and Nega-Hadamard Transform

School of Mathematical Science, Huaibei Normal University, Huaibei, Anhui 235000, China

Received 29 June 2015; Revised 23 October 2015; Accepted 26 October 2015

Academic Editor: Laura Gardini

Copyright © 2015 Zepeng Zhuo and Jinfeng Chong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. O. S. Rothaus, “On ‘bent'’ functions,” Journal of Combinatorial Theory, Series A, vol. 20, no. 3, pp. 300–305, 1976. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. C. Riera and M. G. Parker, “Generalized bent criteria for Boolean functions (I),” IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4142–4159, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. M. G. Parker and A. Pott, “On Boolean functions which are bent and negabent,” in Sequences, Subsequences, and Consequences, S. W. Golomb, G. Gong, T. Helleseth, and H.-Y. Song, Eds., vol. 4893 of Lecture Notes in Computer Science, pp. 9–23, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  4. K. U. Schmidt, M. G. Parker, and A. Pott, “Negabent functions in the Maiorana-McFarland class,” in Sequences and Their Applications—SETA 2008, S. W. Golomb, M. G. Parker, A. Pott, and A. Winterof, Eds., vol. 5203 of Lecture Notes in Computer Science, pp. 390–402, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  5. S. Sarkar, “On the symmetric negabent Boolean functions,” in Progress in Cryptology—INDOCRYPT 2009, B. Roy and N. Sendrier, Eds., vol. 5922 of Lecture Notes in Computer Science, pp. 136–143, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  6. P. Stănică, S. Gangopadhyay, A. Chaturvedi, A. K. Gangopadhyay, and S. Maitra, “Nega-Hadamard transform, bent and negabent functions,” in Sequences and Their Applications—SETA 2010, C. Carlet and A. Pott, Eds., vol. 6338 of Lecture Notes in Computer Science, pp. 359–372, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  7. S. Gangopadhyay and A. Chaturvedi, “A new class of bent-negabent Boolean Functions,” http://eprint.iacr.org/2010/597.pdf.
  8. S. Sarkar, “Characterizing negabent Boolean functions over finite fields,” in Sequences and Their Applications—SETA 2012, T. Hellsesth and J. Jedwab, Eds., vol. 7280 of Lecture Notes in Computer Science, pp. 77–88, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  9. P. Stănică, S. Gangopadhyay, A. Chaturvedi, A. K. Gangopadhyay, and S. Maitra, “Investigations on bent and negabent functions via the Nega-Hadamard transform,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 4064–4072, 2012. View at Publisher · View at Google Scholar
  10. W. Su, A. Pott, and X. Tang, “Characterization of negabent functions and construction of bent-negabent functions with maximum algebraic degree,” IEEE Transactions on Information Theory, vol. 59, no. 6, pp. 3387–3395, 2013. View at Publisher · View at Google Scholar
  11. F. Zhang, Y. Wei, and E. Pasalic, “Constructions of bent—negabent functions and their relation to the completed Maiorana—MCFArland class,” IEEE Transactions on Information Theory, vol. 61, no. 3, pp. 1496–1506, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  12. C. Carlet, “On the secondary constructions of resilient and bent functions,” in Coding, Cryptography and Combinatorics, vol. 23 of Progress in Computer Science and Applied Logic, pp. 3–28, Birkhäuser, Basel, Switzerland, 2004. View at Google Scholar · View at MathSciNet
  13. W. Zhang and G. Xiao, “Constructions of almost optimal resilient Boolean functions on large even number of variables,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5822–5831, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. W.-G. Zhang and E. Pasalic, “Constructions of resilient S-boxes with strictly almost optimal nonlinearity through disjoint linear codes,” IEEE Transactions on Information Theory, vol. 60, no. 3, pp. 1638–1651, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. B. Preneel, W. V. Leekwijck, L. V. Linden et al., “Propagation characteristics of Boolean functions,” in Advances in Cryptology—EUROCRYPT '90, vol. 473 of Lecture Notes in Computer Science, pp. 161–173, Springer, Berlin, Germany, 1991. View at Google Scholar
  16. T. W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, Elsevier-Academic Press, 2009.