111
Views
7
CrossRef citations to date
0
Altmetric
SECTION A

Permutation equivalence of cubic rotation symmetric Boolean functions

Pages 1568-1573 | Received 06 Jan 2014, Accepted 29 Aug 2014, Published online: 08 Oct 2014

References

  • M.L. Bileschi, T.W. Cusick, and D. Padgett, Weights of Boolean cubic monomial rotation symmetric functions, Cryptogr. Commun. 4 (2012), pp. 105–130. doi: 10.1007/s12095-011-0060-4
  • A. Brown and T.W. Cusick, Recursive weights for some Boolean functions, J. Math. Cryptol. 6 (2012), pp. 105–135. doi: 10.1515/jmc-2011-0020
  • A. Brown and T.W. Cusick, Equivalence classes for cubic rotation symmetric functions, Cryptogr. Commun. 5 (2013), pp. 85–118. doi: 10.1007/s12095-012-0075-5
  • D. Canright, J.H. Chung, and P. Stănică, Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions, to appear.
  • C. Carlet, Boolean functions for cryptography and error-correcting codes, in Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Y. Crama and P.L. Hammer, eds., Cambridge University Press, Cambridge, 2010, pp. 257–397.
  • T.W. Cusick, Affine equivalence of cubic homogeneous rotation symmetric Boolean functions, Inform. Sci. 181 (2011), pp. 5067–5083. doi: 10.1016/j.ins.2011.07.002
  • T.W. Cusick and A. Brown, Affine equivalence for rotation symmetric Boolean functions with pk variables, Finite Fields Appl. 18 (2012), pp. 547–562. doi: 10.1016/j.ffa.2011.11.005
  • T.W. Cusick and Y. Cheon, Affine equivalence of quartic homogeneous rotation symmetric Boolean functions, Inform. Sci. 259 (2014), pp. 192–211. doi: 10.1016/j.ins.2013.09.001
  • T.W. Cusick and P. Stănică, Fast evaluation, weights and nonlinearity of rotation-symmetric functions, Discret Math. 258 (2002), pp. 289–301. doi: 10.1016/S0012-365X(02)00354-0
  • T.W. Cusick and P. Stănică, Cryptographic Boolean Functions, Academic Press, San Diego, CA, 2009.
  • B. Elspas and J. Turner, Graphs with circulant adjacency matrices, J. Comb. Theory 9 (1970), pp. 297–307. doi: 10.1016/S0021-9800(70)80068-0
  • S. Kavut, S. Maitra, and M.D. Yücel, Search for Boolean functions with excellent profiles in the rotation symmetric class, IEEE Trans. Inform.Theory 53 (2007), pp. 1743–1751. doi: 10.1109/TIT.2007.894696
  • S. Kavut and M.D. Yücel, 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class, Inform. Comput. 208 (2010), pp. 341–350. doi: 10.1016/j.ic.2009.12.002
  • H. Kim, S.-M. Park, and S.G. Hahn, On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2, Discret Appl. Math. 157 (2009), pp. 428–432. doi: 10.1016/j.dam.2008.06.022
  • N.J. Patterson and D.H. Wiedemann, The covering radius of the (215,16) Reed–Muller code is at least 16276, IEEE Trans. Inform. Theory 29 (1983), pp. 354–356. doi: 10.1109/TIT.1983.1056679
  • N.J. Patterson and D.H. Wiedemann, Correction to ‘The covering radius of the (215,16) Reed–Muller code is at least 16276’, IEEE Trans. Inform. Theory 36 (1990), p. 443.
  • J. Pieprzyk and C.X. Qu, Fast hashing and rotation-symmetric functions, J. UCS 5 (1999), pp. 20–31.
  • B. Wang, X. Zhang, and W. Chen, The Hamming weight and nonlinearity of a type of rotation symmetric Boolean function, Acta Math. Sinica (China Ser.) 55 (2012), pp. 613–626.
  • D. Wiedemann and M.E. Zieve, Equivalence of sparse circulants: The bipartite Ádám problem, arXiv.org 0706.1567v1, 2007.
  • X. Zhang, H. Guo, R. Feng, and Y. Li, Proof of a conjecture about rotation symmetric functions, Discret Math. 311 (2011), pp. 1281–1289. doi: 10.1016/j.disc.2011.03.012

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.