• Corpus ID: 20941721

On testing bent functions

  title={On testing bent functions},
  author={Abhishek Bhrushundi},
  journal={Electron. Colloquium Comput. Complex.},
  • Abhishek Bhrushundi
  • Published 2013
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
A bent function is a Boolean function all of whose Fourier coefficients are equal in absolute value. These functions have been extensively studied in cryptography and play an important role in cryptanalysis and design of cryptographic systems. We study bent functions in the framework of property testing. In particular, we show that testing whether a given Boolean function on n variables is bent, or 1 8 -far from being bent, requires Ω(n) queries. As an intermediate step in our proof, we show… 
1 Citations
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees
It is observed that the query complexity of testing properties of linear and quadratic functions can be characterized in terms of complexity in another model of computation called parity decision trees.


Testing properties of boolean functions
A new model of property testing that closely minors the active learning model is introduced and testing results in this new model may be used to improve the efficiency of model selection algorithms in learning theory.
Testing Low-Degree Polynomials over GF(2(
Any algorithm for testing degree-k polynomials over GF(2) must perform \(\Omega(\frac{1}{\epsilon}+2^k)\) queries, and the result is essentially tight.
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching
It is proved that isomorphism to any boolean function on {0, 1}n with a polynomial number of distinct permutations can be tested with a number of queries that is independent of n.
Property Testing via Set-Theoretic Operations
For the problem of testing disjunc- tion of linear functions, which was previously known to be one-sided testable with a super-polynomial query complexity, this work gives an improved analysis and shows it has query complexity O(1=† 2 ), where † is the distance parameter.
Self-testing/correcting with applications to numerical problems
This work presents general techniques for constructing simple to program self-testing/correcting pairs for a variety of numerical functions, including integer multiplication, modular multiplication, matrix multiplication, inverting matrices, computing the determinant of a matrix, Computing the rank of a Matrix, integer division, modular exponentiation, and polynomial multiplication.
Analysis of Boolean Functions
This text gives a thorough overview of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry, and includes a "highlight application" such as Arrow's theorem from economics.
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
It is proved that the randomized/quantum communication complexity of the singularity problem over F_p is Omega(n^2 log p), which implies the same space lower bound for randomized streaming algorithms, even for a constant number of passes.
Lower Bounds in Communication Complexity
Lower Bounds in Communication Complexity focuses on showing lower bounds on the communication complexity of explicit functions, and treats different variants of communication complexity, including randomized, quantum, and multiparty models.
Algebraic property testing: the role of invariance
This work considers (F-)linear properties that are invariant under linear transformations of the domain and proves that an O(1)-local "characterization" is a necessary and sufficient condition for O( 1)-local testability, and shows that local formal characterizations essentially imply local testability.
On "Bent" Functions