• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.691-706
• /
• 2011

Since security and privacy problems in RFID systems have attracted much attention, numerous RFID authentication protocols have been suggested. One of the various design approaches is to use light-weight logics such as bitwise Boolean operations and addition modulo $2^m$ between m-bits words. Because these operations can be implemented in a small chip area, that is the major requirement in RFID protocols, a series of protocols have been suggested conforming to this approach. In this paper, we present new attacks on these lightweight RFID authentication protocols by using the Gr$\ddot{o}$bner basis. Our attacks are superior to previous ones for the following reasons: since we do not use the specific characteristics of target protocols, they are generally applicable to various ones. Furthermore, they are so powerful that we can recover almost all secret information of the protocols. For concrete examples, we show that almost all secret variables of six RFID protocols, LMAP, $M^2AP$, EMAP, SASI, Lo et al.'s protocol, and Lee et al.'s protocol, can be recovered within a few seconds on a single PC.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.432-443
• /
• 2005

Recent three-dimensional feature-based CAD systems based on solid or non-manifold modelling functionality have been widely used for product design in manufacturing companies. When product models associated with features are used in various downstream applications such as analysis, however, simplified and abstracted models at various levels of detail (LODs) are frequently more desirable and useful than the full detailed model. To provide multi-resolution models, the features need to be rearranged according to a criterion that measures the significance of the feature. However, if the features are rearranged, the resulting shape is possibly different from the original because union and subtraction Boolean operations are not commutative. To solve this problem, in this paper, the new concept of the effective zone of a feature is defined and identified using Boolean algebra. By introducing the effective zone, an arbitrary rearrangement of features becomes possible and arbitrary LOD criteria may be selected to suit various applications. Besides, because the effective zone of a feature is independent of the data structure of the model, the multi-resolution modelling algorithm based on the effective zone can be implemented on any 3D CAD system based on conventional solid representations as well as non-manifold topological (NMT) representations.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.767-776
• /
• 2009

The purpose of this paper is to design, implement and test the automatic marking system for programming languages using key-words and boolean operations to solve the processing problems of natural languages. There are accurate grammar systems and key-words in programming languages. Using these characteristics, We have designed, programmed, and tested automatic marking system for programming languages through key-words and boolean operations in this paper. We have categorized programming languages into 7 types as the type of answer and when a professor input any key-words, the system make him put conjunction with the special character. It can be logical expressions instantly so that the system easily operates. We asked 10 students who are majoring in computer engineering to take a test on the paper and web to show how well automatic marking system that we have programmed works. Then We requested 3 professors if the subject problems marked objectively. As a result, automatic marking system proved to be appropriate. We have proposed the way of using key-words and boolean operation for prohibiting huge natural language processing in marking of subjective question. It promotes efficiency rate of programming, objectivity and speed through the transferal to the web for marking since the system prohibits marker to include personal opinion on marking and gives feedback quickly

• 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.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.11-19
• /
• 1998

Non-manifold topological operations such as Euler and Boolean operations provide a versatile environment for modeling domains. The implementation of these operations raises geometrical issues that need to be addressed to ensure the topological validity of the underlying model, and they uses the glue operation which provides a basic method to modify the topology of non-manifold models when vertices, edges and faces are contacting each other. Topological information such as adjacency relationships should be inferred when gluing non-manifold models. Two methods of reasoning can be employed to find the topological information : topological reasoning and geometrical reasoning. The topological method can infer the adjacency relationships by using stored topological information. On the other hand, the geometrical method can find topological ambiguities by considering the geometrical shape at the local area of gluing when the topological relations were not stored. This paper describes the geometrical reasoning method.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.7
• /
• pp.100-114
• /
• 1996

In order to create a solid model more efficiently for a plastic or sheet metal product with a thin and constant thickness, various methods have been proposed up to now. One of the most typical approaches is to create a sheet model initially and then transform it into a solid model automatically for a given thickness. The sheet model as well as the transitive model in sheet modeling procedure is a non-manifold model. However, the previous methods adopted the boundary representations for a solid model as their topological framework. Thus, it is difficult to represent the exact adjacency relationship between topological entities and to implement the topological operations for sheet modeling and the transformation procedure of a sheet into a solid. In this paper, we proposed a sheet modeling system based on a non-manifold topological representation which can represent solids, sheets, wireframes, and their mixture. A set of generalized Euler operators for non-manifold topology as well as the sheet modeling capabilities including adding, bending, and punching functions are provided for easy modeling of sheet objects, and they are perfomed interactively with a two dimensional curve editor. Once a sheet model is completed, it can be transformed into a solid automatically. The transformation procedure is composed of the offset functions and the Boolean operations of sheet models, and it is even more comprehensive and easier to be implemented than the precious methods.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.233-242
• /
• 2010

In the recent years, power attacks were widely investigated, and so various countermeasures have been proposed. In the case of block ciphers, masking methods that blind the intermediate results in the algorithm computations(encryption, decryption) are well-known. In case of SEED block cipher, it uses 32 bit arithmetic addition and S-box operations as non-linear operations. Therefore the masking type conversion operations, which require some operating time and memory, are required to satisfy the masking method of all non-linear operations. In this paper, we propose a new masked S-boxes that can minimize the number of the masking type conversion operation. Moreover we construct just one masked S-box table and propose a new formula that can compute the other masked S-box's output by using this S-box table. Therefore the memory requirements for masked S-boxes are reduced to half of the existing masking method's one.

• Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.370-384
• /
• 2016

Computer-aided materials design requires new modeling approaches to characterize and represent fine-grained geometric structures and material compositions at multiple scales. Recently, a dual-Rep approach was developed to model materials microstructures based on a new basis function, called surfacelet. As a combination of implicit surface and wavelets, surfacelets can efficiently identify and represent planar, cylindrical, and ellipsoidal geometries in material microstructures and describe the distribution of compositions and properties. In this paper, these primitive surfacelets are extended and composite surfacelets are proposed to model more complex geometries. Composite surfacelets are constructed by Boolean operations on the primitives. The surfacelet transform is applied to match geometric features in three-dimensional images. The composition of the material near the identified features can then be modeled. A cubic surfacelet and a v-joint surfacelet are developed to demonstrate the reverse engineering process of retrieving material compositions from material images.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.551-554
• /
• 2002

The paper discusses new approach for machining operation simulation using enhanced Z map algorithm. To extract the required geometric information from NC code, suggested algorithm uses supersampling method to enhance the efficiency of a simulation process. By executing redundant Boolean operations in a grid cell and averaging down calculated data, presented algorithm can accurately represent material removal volume though tool swept volume is negligibly small. Supersampling method is the most common form of antialiasing and usually used with polygon mesh rendering in computer graphics. The key advantage of enhanced Z map model is that the data structure is same with conventional Z map model, though it can acquire higher accuracy and reliability with same or lower computation time. By simulating machining operation efficiently, this system can be used to improve the reliability and efficiency of NC machining process as well as the quality of the final product.

• Bulletin of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.9-13
• /
• 1983

M$_{n}$(F) denotes the set of all n*n matrices over F={0, 1}. For a, b.mem.F, define a+b=max{a, b} and ab=min{a, b}. Under these operations a+b and ab, M$_{n}$(F) forms a multiplicative semigroup (see [1], [4]) and we call it the semigroup of the n*n boolean matrices over F={0, 1}. Since the semigroup M$_{n}$(F) is the matrix representation of the semigroup B$_{n}$ of the binary relations on the set X with n elements, we may identify M$_{n}$(F) with B$_{n}$ for finding all D-classes.l D-classes.