The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function

In this paper, we discuss the properties of the derivative of a special function, and propose a general approach to estimating a class of trigonometric sums based on the derivative of the special function. Then we apply the approach to three trigonometric sums and get three new estimates. Using the...

Full description

Saved in:
Bibliographic Details
Published in:Designs, codes, and cryptography codes, and cryptography, 2023-03, Vol.91 (3), p.921-949
Main Authors: Tong, Yan, Zeng, Xiangyong, Zhang, Shasha, Xu, Shiwei, Ren, Zhengwei
Format: Article
Language:English
Subjects:
Boolean functions
Coding and Information Theory
Computer Science
Cryptography
Cryptology
Discrete Mathematics in Computer Science
Estimates
Linear feedback shift registers
Lower bounds
Sums
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we discuss the properties of the derivative of a special function, and propose a general approach to estimating a class of trigonometric sums based on the derivative of the special function. Then we apply the approach to three trigonometric sums and get three new estimates. Using the estimate of the first trigonometric sum, we deduce new upper and lower bounds of the arithmetic mean value for a trigonometric sum of Vinogradov. Using the estimate of the second trigonometric sum, we derive a new upper bound on the imbalance properties of Linear Feedback Shift Register subsequences. We also deduce a new lower bound on the nonlinearity of the Carlet–Feng vectorial Boolean function with the estimate of the third trigonometric sum.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-022-01140-1