A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
Loading...
Authors
Wang, Qichun
Stănică, Pantelimon
Subjects
Carlet–Feng function
Tang–Carlet–Tang function
Trigonometric sum
Nonlinearity
Tang–Carlet–Tang function
Trigonometric sum
Nonlinearity
Advisors
Date of Issue
2019
Date
2019
Publisher
Springer
Language
en_US
Abstract
In this paper, we give a sharp estimate of a trigonometric sum which has several applications in cryptography and sequence theory. Using this estimate, we deduce new lower bounds on the nonlinearity of Carlet–Feng function, which has very good cryptographic properties with its nonlinearity bound being improved in numerous papers, as well as the function proposed by Tang–Carlet–Tang.
Type
Article
Description
The article of record as published may be found at https://doi.org/10.1007/s10623-018-0574-2
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
15 p.
Citation
Q. Wang, P. Stanica, A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions, Designs, Codes, Crypt. 87:8 (2019), 1749-1763.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.