Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Counting Boolean functions with faster points
Date
2020-09-01
Author
Salagean, Ana
Özbudak, Ferruh
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
172
views
0
downloads
Cite This
Duan and Lai introduced the notion of "fast point" for a Boolean function f as being a direction a so that the algebraic degree of the derivative of f in direction a is strictly lower than the expected deg(f) - 1. Their study was motivated by the fact that the existence of fast points makes many cryptographic differential attacks (such as the cube and AIDA attack) more efficient. The number of functions with fast points was determined by Duan et al. in some special cases and by Salagean and Mandache-Salagean in the general case. We generalise the notion of fast point, defining a fast point of order l as being a fast point a so that the degree of the derivative of f in direction a is lower by at least l than the expected degree. We determine an explicit formula for the number of functions of degree d in n variables which have fast points of order l. Furthermore, we determine the number of functions of degree d in n variables which have a given number of fast points of order l, and also the number of functions which have a given profile in terms of the number of fast points of each order. We apply our results to compute the probability of a function to have fast points of order l. We also compute the number of functions which admit linear structures (i.e. their derivative in a certain direction is constant); such functions have a long history of being used in the analysis of symmetric ciphers.
Subject Keywords
Applied mathematics
,
Computer science applications
URI
https://hdl.handle.net/11511/36054
Journal
DESIGNS CODES AND CRYPTOGRAPHY
DOI
https://doi.org/10.1007/s10623-020-00738-7
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
Counting Boolean Functions with Faster Points
Salagean, Ana; Özbudak, Ferruh (null; 2019-03-31)
Duan and Lai introduced the notion of “fast point” for a Boolean function f as being a direction a so that the algebraic degree of the derivative of f in direction a is strictly lower than the expected deg (f) - 1. Their study was motivated by the fact that the existence of fast points makes many cryptographic differential attacks (such as the cube and AIDA attack) more efficient. The number of functions with fast points was determined by Duan et al. in some special cases and by Sălăgean and Mandache-Sălăge...
SOME INFINITE INTEGRALS INVOLVING PRODUCTS OF EXPONENTIAL AND BESSEL-FUNCTIONS
Tezer, Münevver (Informa UK Limited, 1989-01-01)
This paper is concerned with the evaluation of some infinite integrals involving products of exponential and Bessel functions. These integrals are transformed, through some identities, into the expressions containing modified Bessel functions. In this way, the difficulties associated with the computations of infinite integrals with oscillating integrands are eliminated.
Finite type points on subsets of C-n
Yazıcı, Özcan (Elsevier BV, 2020-07-01)
In [4], D'Angelo introduced the notion of points of finite type for a real hypersurface M subset of C-n and showed that the set of points of finite type in M is open. Later, Lamel-Mir [8] considered a natural extension of D'Angelo's definition for an arbitrary set M subset of C-n. Building on D'Angelo's work, we prove the openness of the set of points of finite type for any subset M subset of C-n.
Accurate numerical bounds for the spectral points of singular Sturm-Liouville problems over 0 < x < infinity
Taşeli, Hasan (Elsevier BV, 2004-03-01)
The eigenvalues of singular Sturm-Liouville problems defined over the semi-infinite positive real axis are examined on a truncated interval 0<x<l as functions of the boundary point l. As a basic theoretical result, it is shown that the eigenvalues of the truncated interval problems satisfying Dirichlet and Neumann boundary conditions provide, respectively, upper and lower bounds to the eigenvalues of the original problem. Moreover, the unperturbed system in a perturbation problem, where l remains sufficient...
Counting Boolean functions with specified values in their Walsh spectrum
Uyan, Erdener; Calik, Cagdas; Doğanaksoy, Ali (Elsevier BV, 2014-03-15)
The problem of counting Boolean functions with specified number s of Walsh coefficients omega in their Walsh spectrum is discussed in this paper. Strategies to solve this problem shall help solving many more problems related to desired cryptographic features of Boolean functions such as nonlinearity, resiliency, algebraic immunity, etc. In an attempt to study this problem, we present a new framework of solutions. We give results for vertical bar omega vertical bar >= 2(n-1) and for all s, in line with a pre...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Salagean and F. Özbudak, “Counting Boolean functions with faster points,”
DESIGNS CODES AND CRYPTOGRAPHY
, pp. 1867–1883, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36054.