• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.1
• /
• pp.47-56
• /
• 2004

The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.407-417
• /
• 2004

It is well known that the nonlinearity of vector Boolean functions F on n-dimensional vector space $GF(2)^n$ to $GF(2)^m$ is bounded above by $2^{n-1} - 2 ^{\frac{n}{2}-1}$. In this paper we derive upper bounds and a lower bound on the nonlinearity of vector Boolean functions in terms of auto-correlations. Strengths and weaknesses of each bounds are examined. Also, we modify the notions of the sum-of-square indicator and absolute indicator for Boolean functions to the case of vector Boolean functions to measure global avalanche characteristics of vector Boolean functions. Using those indicators we compare the global avalanche characteristics of DES (Data Encryption System) and Rijndael.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.561-574
• /
• 2023

In this paper, we focus on establishing the MacWilliams-type identities on vectorial Boolean functions with bent component functions. As their applications, we provide a bound for the non-existence of vectorial dual-bent functions with prescribed minimum degree, and several Gleason-type theorems are presented as well.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.5 no.1
• /
• pp.3-16
• /
• 1995

In this paper, we deal with the cryptographic properties of Boolean functions generated by recursively extended methods from the points of balancedness, nonlinearity and correlation properties. First, we propose a new concept 'Strict Uncorrelated Criterion(SUC)' for two Boolean functions as a necessary condition for constructing Boolean functions of S-box which can be guaranteed to be resistant against Differential cryptanalysis, then we show that the recurively extended Boolean functions with particular form preserve the SUC. We also examine the correlation properties of Boolean functions using Walsh-Hadamard transformations and apply them to discuss nonlinearity, correlation properties and SUC of semi-bent function which is defined over odd dimensional vector space. Finally, we compare semi-bent function with Boolean functions which are generated by other similar recursive methods.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.337-340
• /
• 2000

In this paper, we put forth a procedure that target low power logic synthesis based on XOR representation of Boolean functions, and the results of synthesis procedure are a multi-level XOR form with minimum switching activity. Specialty, this paper show a method to extract the common cubes or kernels by Boolean matrix and rectangle covering, and to estimate the power consumption in terms of the extracted common sub-functions.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.195-206
• /
• 2008

The purpose of this note is to compare the rings of continuous functions, integer-valued or real-valued, in pointfree topology with those in classical topology. To this end, it first characterizes the Boolean frames (= complete Boolean algebras) whose function rings are isomorphic to a classical one and then employs this to exhibit a large class of frames for which the functions rings are not of this kind. An interesting feature of the considerations involved here is the use made of nonmeasurable cardinals. In addition, the integer-valued function rings for Boolean frames are described in terms of internal lattice-ordered ring properties.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.

• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.259-268
• /
• 1996

The Data Encryption Standard(DES) [3, 8, 9] was developed by an IBM team aroung 1974 and adopted as a national standard in 1977.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.6
• /
• pp.127-134
• /
• 2001

At PKC\`98, SangUk Shin et al. proposed a new hash function based on advantages of SHA-1, RIPEMD-160, and HAVAL. They claimed that the Boolean functions of the hash function have good properties including the SAC(Strict Avalanche Criterion). In this paper, we first show that some of Boolean functions which are used in Shin\`s hash function does not satisfy the SAC, and then argue that satisfying the SAC may not be a good property of Boolean functions, when it is used for constructing compress functions of a hash function.