Abstract
We compute the non-linearity of Boolean functions with Gröbner bases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Carlet, Boolean methods and models, ch. Boolean Functions for Cryptography and Error Correcting Codes, Cambridge University Press, 2009, to appear.
E. Guerrini, M. Orsini, and M. Sala, Computing the distance distribution of systematic non-linear codes, BCRI preprint, www.bcri.ucc.ie 50, UCC, Cork, Ireland, 2006.
M. Sala and I. Simonetti, An algebraic description of Boolean functions, Proc. of WCC 2007 (2007), 343–349.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Simonetti, I. (2009). On the Non-linearity of Boolean Functions. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93805-7
Online ISBN: 978-3-540-93806-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)