• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1802-1819
• /
• 2017

Correlation-enhanced collision attack has been proposed by Moradi et al. for several years. However, in practical operations, this method costs lots of time on trace acquisition, storage and averaging due to its bytewise collision detection. In this paper, we propose a bitwise collision attack based on second-order distance model. In this method, only 9 average traces are enough to finish a collision attack. Furthermore, two candidate models are given in this study to distinguish collisions, and the corresponding practical experiments are also performed. The experimental results indicate that the operation time of our attack is only 8% of that of correlation-enhanced collision attack, when the two success rates are both above 0.9.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.296-308
• /
• 2015

Advanced Encryption Standard (AES) is widely used for protecting wireless sensor network (WSN). At the Workshop on Cryptographic Hardware and Embedded Systems (CHES) 2012, G$\acute{e}$rard et al. proposed an optimized collision attack and break a practical implementation of AES. However, the attack needs at least 256 averaged power traces and has a high computational complexity because of its byte wise operation. In this paper, we propose a novel double sieve collision attack based on bitwise collision detection, and an improved version with an error-tolerant mechanism. Practical attacks are successfully conducted on a software implementation of AES in a low-power chip which can be used in wireless sensor node. Simulation results show that our attack needs 90% less time than the work published by G$\acute{e}$rard et al. to reach a success rate of 0.9.

• Journal of Korea Game Society
• /
• v.17 no.1
• /
• pp.17-26
• /
• 2017

Several algorithms have been introduced to render motion blur in real time by solving the visibility problem in the spatio-temporal domains. However, some algorithms render at interactive frame rates but have artifacts or noise. Therefore, we propose a new algorithm that renders real-time motion blur using extruded triangles. Our method uses two triangles in the previous and the current frame to make an extruded triangle then send it to the rasterization. To solve the occlusion between extruded triangles for a given pixel, we introduce a combining solution using a sorting in front to back order and bitwise operations in the spatio-temporal dimensions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.35-44
• /
• 2006

Recently, a lot of index techniques for storing and querying XML document have been studied so far and many researches of them used coordinate-based methods. But update operation and query processing to express structural relations among elements, attributes and texts make a large burden. In this paper, we propose an efficient BitmapInvert index technique based on Relative Position Coordinate (RPC). RPC has good preformance even if there are frequent update operations because it represents relationship among parent node and left, right sibling nodes. BitmapInvert index supports tort query with bitwise operations and does not casue serious performance degradations on update operations using PostUpdate algerian. Overall, the performance could be improved by reduction of the number of times for traversing nodes.

• The Journal of Information Technology
• /
• v.9 no.4
• /
• pp.49-55
• /
• 2006

In this paper, a new fragile watermarking algorithm for digital image is presented, which makes resolving the security and forgery problem of the digital image to be possible. The most suitable watermarking method that verifies the authentication and integrity of the digital image is the Wong's method, which invokes the hash function (MD5). The algorithm is safe because this method uses the hash function of the cryptology. The operations such as modulus, complement, shift, bitwise exclusive-or, bitwise inclusive-or are necessary for calculating the value of hash function. But, in this paper, an Arithmetic encoding method that only includes the multiplication operation is adopted. This technique prints out accumulative probability interval, which is obtained by multiplying the input symbol probability interval. In this paper, the initial probability interval is determined according to the value of the key, and the input sequence of the symbols is adjusted according to the key value so that the accumulative probability interval will depend on the key value. The integrity of the algorithm has been verified by experiment. The PSNR is above the 51.13db and the verifying time is $1/3{\sim}1/4$ of the verifying time of using the hash function (MD5), so, it can be used in the real-time system.

• Journal of Digital Contents Society
• /
• v.18 no.8
• /
• pp.1603-1613
• /
• 2017

This paper proposes a method for effectively segmenting the hand region using a widely popular RGB color-based webcam. This performs the empirical preprocessing method four times to remove the noise. First, we use Gaussian smoothing to remove the overall image noise. Next, the RGB image is converted into the HSV and the YCbCr color model, and global fixed binarization is performed based on the statistical value for each color model, and the noise is removed by the bitwise-OR operation. Then, RDP and flood fill algorithms are used to perform contour approximation and inner area fill operations to remove noise. Finally, ROI (hand region) is selected by eliminating noise through morphological operation and determining a threshold value proportional to the image size. This study focuses on the noise reduction and can be used as a base technology of gesture recognition application.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1314-1320
• /
• 2019

In this paper, we propose a new method for optimizing bit operations and applying them to DNN(Deep Neural Network) in software environment. As a method for this, we propose a packing function for bitwise optimization and a masking matrix multiplication operation for application to DNN. The packing function converts 32-bit real value to 2-bit quantization value through threshold comparison operation. When this sequence is over, four 32-bit real values are changed to one 8-bit value. The masking matrix multiplication operation consists of a special operation for multiplying the packed weight value with the normal input value. And each operation was then processed in parallel using a GPU accelerator. As a result of this experiment, memory saved about 16 times than 32-bit DNN Model. Nevertheless, the accuracy was within 1%, similar to the 32-bit model.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.1-6
• /
• 2018

In this paper, we propose a method dividing effectively the hand and fingers using general webcam. The method executes 4 times empirically preprocessing one to erase noise. First, it erases the overall noise of the image using Gaussian smoothing. Second, it changes from RGB image to HSV color model and YCbCr color model, executes a global static binarization based on the statistical value for each color model, and erase the noise through bitwise-OR operation. Third, it executes outline approximation and inner region filling algorithm using RDP algorithm and Flood fill algorithm and erase noise. Lastly, it erases noise through morphological operation and determines the threshold propositional to the image size and selects the hand and fingers area. This paper compares to existing one color based hand area division method and focuses the noise deduction and can be used to a gesture recognition application.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.153-160
• /
• 1996

In this paper, we propose an efficient digital architecture for the discrete-time cellular neural networks (DTCNN's). DTCNN's have the locality and the translation invariance in the templates which determine the patterns of the connection between the cells. Using distributed arithmetic (DA) and the characteristics of DTCNN, we propose a simple implementation of DTCNN. The bus width in the cell-to-cell interconnection is reduced to one bit because of DA's bitwise operation. We implemented the reconfigurable architecture of DTCNN using programmable FPGA.

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.5
• /
• pp.428-434
• /
• 2016

A lot of drawings for pipe construction and installation are needed to construct plant process system on the offshore plant structures. Depending on their scale or complexity, the required number of drawings related pipes sometimes amounts to several hundreds of thousands. Most major shipyards, therefore, have their own system which can automatically depict pipes’ geometric, manufacturing, and BOM(Bill of Material) information on the drawings. However, as the complexity and absolute quantity in the isometric region on the drawings is increased, the information extraction from the customized DB and positioning at the typical locations does not get to be enough to avoid the overlap between geometric contours, labels, and symbols. For this reason, the novel methods to arrange additional annotations without overlaps are presented in the paper. This approach is expected to increase the readability and legibility of the drawing and prevent the human error, and finally decrease the time-consuming and tedious jobs which are unnecessarily required to designers.