• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.8-15
• /
• 2009

Side-channel attacks including the differential power analysis attack are often more powerful than classical cryptanalysis and have to be seriously considered by cryptographic algorithm's implementers. Various countermeasures have been proposed against such attacks. In this paper, we deal with the masking method, which is known to be a very effective countermeasure against the differential power analysis attack and propose new gate-level conversion methods between Boolean and arithmetic masks. The new methods require only 6n-5 XOR and 2n-2 AND gates with 3n-2 gate delay for converting n-bit masks. The basic idea of the proposed methods is that the carry and the sum bits in the ripple adder are manipulated in a way that the adversary cannot detect the relation between these bits and the original raw data. Since the proposed methods use only bitwise operations, they are especially useful for DPA-securely implementing cryptographic algorithms in hardware which use both Boolean and arithmetic operations. For example, we applied them to securely implement the block encryption algorithm SEED in hardware and present its detailed implementation result.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1397-1406
• /
• 1996

In this paper, we propose a discrete model of conveyor systems, which is frequently used in flexible manufacturing systems to transfer work-in-process( WIP) between manipulators. In the case where the time required for transferring WIP's between manipulators are greater than that of manufacturing itself, as in many flexible assembly lines, the quantitative model of the transfer systems is needed to analyze the behavior and productivity of the whole manufacturing system. The proposed model is based upon the assumptions that the length of any unit conveyor component is integer multiple of the length of a pallet and hat the transferring speed of the conveyor is constant. Under these assumptions, the observation moments and the length of the conveyor can be quantized. Hence, the state of a conveyor can be represented by two kinds of Boolean variables: one representing the presence of a pallet on each quantize conveyor length and the other representing the mobility of this pallet. The whole conveyor system can be modeling as a network composed of branches and knots based on these two Boolean variables. The proposed modelling method was tested with various conveyor system configurations and showed that the model can be adopted successfully for the simulation of transfer systems and of the piloting of manufacturing processes.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.395-408
• /
• 2004

A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).

• Honam Mathematical Journal
• /
• v.26 no.1
• /
• pp.3-15
• /
• 2004

In the fuzzy theory, a matrix A is idempotent if $A^2=A$. The idempotent fuzzy matrices are important in various applications and have many interesting properties. Using the upper diagonal completion process, we have the zero patterns of idempotent fuzzy matrix, that is, the idempotent Boolean matrices. In addition, we give the construction of all idempotent fuzzy matrices for each dimension n.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.69-72
• /
• 1979

This paper deals with the computer method of finding the minimal sum of products for a switching function by using the MASK method derived from the characteristics of the Boolean algebra. The experiments with the program which is dissimilar to the previous computer programs show that the algorithm presented will be more efficient.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1997.11a
• /
• pp.196-202
• /
• 1997

[6]에서 Zhang과 Zheng은 부울함수의 암호학적인 전역상관계수의 특성을 계산하기 위해서 GAC(Global Avalanche Characteristic)이라는 새로운 개념을 제시하였다. 그들은 GAC의 값들에 대한 측적을 위해서 2개의 단위를 제시했고 2개의 단위의 상한과 하한에 대해서 계산했다. 그러나 그들은 균등함수의 GAC의 하한은 향후의 연구과제로 남겨놓았다. 본 논문에서는 균등함수의 GAC의 하한에 대해서 계산했고, 연접의 방법에 의한 좋은 GAC 의 특성을 가지는 함수의 생성방법을 제시하였다.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1061-1064
• /
• 1998

This paper proposes a new topology-based partition method for reconfigurable FPGA systems whose components nd the number of interconnections are predetermined. Here, the partition problem must also consider nets that pass through components such as FPGAs and routing devices to route 100%. We formulate it as a quadratic boolean programming problem suggest a paritition method for it. Experimental results show 100% routing, and up to 15% improvement in the maximum number of I/O pins.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.522-525
• /
• 1998

Although each de Morgan algebra has not always fixed points(centers), it has always fixed cores, the natural extention of fixed points. Fixed cores, of they do not degenerate to fixed points, are Boolean algebras, It is also shown the necessary and sufficient condition a algebra to be a Kleene algebra(fuzzy algebra) is that it has just one fixed core.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.10 no.5
• /
• pp.400-407
• /
• 2005

Reverse engineering is defined as the process where the internal structures and dynamics of a given system are inferred and analyzed from external observations and relevant knowledge. The first part of this paper surveys existing techniques for biosystem reverse engineering. Network structure inference techniques such as Correlation Matrix Construction (CMC), Boolean network and Bayesian network-based methods are explained. After the numeric and logical simulation techniques are briefly described, several representative working software tools were introduced. The second part presents our component-based software architecture for biosystem reverse engineering. After three design principles are established, a loosely coupled federation architecture consisting of 11 autonomous components is proposed along with their respective functions.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.121-135
• /
• 1999

This paper studies the problem of inverting minimal path sets to obtain minimal cut sets for complex system. We describe efficiency of inversion algorithm by the use of boolean algebra and we develop inclusion-exclusion algorithm and pivotal decomposition algorithm for reliability calculation of complex system. Several examples are illustrated and the computation speeds between the two algorithms are undertaken.