Results 281 to 290 of about 12,156,906 (329)
Some of the next articles are maybe not open access.
Designs, Codes and Cryptography, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sihong Su, Xiaoqi Guo
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sihong Su, Xiaoqi Guo
openaire +2 more sources
International Journal of Computer Mathematics, 2011
In this paper, we define a large class of almost balanced Boolean functions called nearly bent functions. These functions lie at large Hamming distance to all affine functions and preserve a high level of algebraic degree. Then a construction of nearly bent functions is described.
WeiGuo Zhang 0001, Chao Lv, GuoZhen Xiao
openaire +1 more source
In this paper, we define a large class of almost balanced Boolean functions called nearly bent functions. These functions lie at large Hamming distance to all affine functions and preserve a high level of algebraic degree. Then a construction of nearly bent functions is described.
WeiGuo Zhang 0001, Chao Lv, GuoZhen Xiao
openaire +1 more source
IEEE Transactions on Information Theory, 2006
In this correspondence, we focus on bent functions of the form F(2 n) rarr F(2) where x rarr Tr(alphaxd). The main contribution of this correspondence is, that we prove that for n=4r, r odd, the exponent d=(2r+1)2 allows the construction of bent functions. This open question has been posed by Canteaut based on computer experiments. As a consequence for
openaire +1 more source
In this correspondence, we focus on bent functions of the form F(2 n) rarr F(2) where x rarr Tr(alphaxd). The main contribution of this correspondence is, that we prove that for n=4r, r odd, the exponent d=(2r+1)2 allows the construction of bent functions. This open question has been posed by Canteaut based on computer experiments. As a consequence for
openaire +1 more source
Constructions of rotation symmetric Bent functions and Bent idempotent functions
Advances in Mathematics of CommunicationsSummary: The class of rotation symmetric functions is extremely rich in terms of cryptographical significance. However, few constructions of rotation symmetric bent functions, which can correspond to bent idempotent functions, have been presented in the literature.
Xiaoyan Chen, Sihong Su
openaire +2 more sources
2010 Information Theory and Applications Workshop (ITA), 2010
Bent functions were first introduced by Rothaus in 1976 as an interesting combinatorial object with the important property of having the maximum distance to all affine functions. Bent functions have many applications to coding theory, cryptography and sequence designs. For many years the focus was on the construction of binary bent functions. There are
Tor Helleseth, Alexander Kholosha
openaire +1 more source
Bent functions were first introduced by Rothaus in 1976 as an interesting combinatorial object with the important property of having the maximum distance to all affine functions. Bent functions have many applications to coding theory, cryptography and sequence designs. For many years the focus was on the construction of binary bent functions. There are
Tor Helleseth, Alexander Kholosha
openaire +1 more source
Siberian mathematical journal, 2020
We prove that (1): the characteristic function of each independent set in each regular graph attaining the Delsarte–Hoffman bound is a perfect coloring; (2): each transversal in a uniform regular hypergraph is an independent set in the vertex adjacency ...
V. Potapov, S. Avgustinovich
semanticscholar +1 more source
We prove that (1): the characteristic function of each independent set in each regular graph attaining the Delsarte–Hoffman bound is a perfect coloring; (2): each transversal in a uniform regular hypergraph is an independent set in the vertex adjacency ...
V. Potapov, S. Avgustinovich
semanticscholar +1 more source
2002
In the paper a method of efficient generation of random bent functions is presented. Obtaining a random bent function is not a straight forward process, since the introduction of bent functions in the most of published works studied their construction and gave algorithms for their generation.
Anna Grocholewska-Czurylo +1 more
openaire +1 more source
In the paper a method of efficient generation of random bent functions is presented. Obtaining a random bent function is not a straight forward process, since the introduction of bent functions in the most of published works studied their construction and gave algorithms for their generation.
Anna Grocholewska-Czurylo +1 more
openaire +1 more source
1995
Highly nonlinear balanced Boolean functions both satisfying the propagation criterion and having almost uniform correlation values with all linear functions are very important in the design of hash functions, stream and block ciphers. In particular, the output uncorrelated properties between two Boolean functions are required to design permutations. We
Seongtaek Chee, Sangjin Lee, Kwangjo Kim
openaire +1 more source
Highly nonlinear balanced Boolean functions both satisfying the propagation criterion and having almost uniform correlation values with all linear functions are very important in the design of hash functions, stream and block ciphers. In particular, the output uncorrelated properties between two Boolean functions are required to design permutations. We
Seongtaek Chee, Sangjin Lee, Kwangjo Kim
openaire +1 more source
Equivalence classes of Niho bent functions
Designs, Codes and Cryptography, 2019Equivalence classes of Niho bent functions are in one-to-one correspondence with equivalence classes of ovals in a projective plane. Since a hyperoval can produce several ovals, each hyperoval is associated with several inequivalent Niho bent functions ...
K. Abdukhalikov
semanticscholar +1 more source
Design methods for semi-bent functions
Information Processing Letters, 2019Semi-bent functions play an important role in the construction of orthogonal variable spreading factor codes used in code-division multiple-access (CDMA) systems as well as in certain cryptographic applications.
E. Pasalic +3 more
semanticscholar +1 more source