• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.1047-1062
• /
• 2022

Differential power analysis (DPA) is disturbed by ghost peaks. There is a phenomenon that the mean absolute difference (MAD) value of the wrong key is higher than the correct key. We propose a compressed key guessing space (CKGS) scheme to solve this problem and analyze the AES algorithm. The DPA based on this scheme is named CKGS-DPA. Unlike traditional DPA, the CKGS-DPA uses two power leakage points for a combined attack. The first power leakage point is used to determine the key candidate interval, and the second is used for the final attack. First, we study the law of MAD values distribution when the attack point is AddRoundKey and explain why this point is not suitable for DPA. According to this law, we modify the selection function to change the distribution of MAD values. Then a key-related value screening algorithm is proposed to obtain key information. Finally, we construct two key candidate intervals of size 16 and reduce the key guessing space of the SubBytes attack from 256 to 32. Simulation experimental results show that CKGS-DPA reduces the power traces demand by 25% compared with DPA. Experiments performed on the ASCAD dataset show that CKGS-DPA reduces the power traces demand by at least 41% compared with DPA.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.69.2-69.2
• /
• 2013

A galaxy cluster is an important laboratory to study the large scale structure in the Universe and the galaxy evolution. In order to identify candidate galaxy clusters at z~1, we have used deep and wide optical-NIR datasets based on IMS, UKIDSS DXS and CFHTLS wide covering ${\sim}20deg^2$ in the SA22 field. We measure the angular two-point correlation function of the candidate clusters and investigate the star formation activity of the member galaxies. Based on bias factor and halo mass function, candidate clusters have the average halo mass of > $10^{14}h^{-1}M_{\odot}$. At z~1, the star formation rate of cluster galaxies is similar to that of field galaxies, which indicates the environmental quenching is not so significant at z~1 as the local Universe.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.150-150
• /
• 1999

In this paper, a content-based image retrieval scheme based on scale-space theory is proposed. The existing methods using scale-space theory consider all scales for image retrieval,thereby requiring a lot of computation. To overcome this problem, the proposed algorithm utilizes amodified histogram intersection method to select candidate images from database. The relative scalebetween a query image and a candidate image is calculated by the ratio of histograms. Feature pointsare extracted from the candidates using a corner detection algorithm. The feature vector for eachfeature point is composed of RGB color components and differential invariants. For computing thesimilarity between a query image and a candidate image, the euclidean distance measure is used. Theproposed image retrieval method has been applied to various images and the performance improvementover the existing methods has been verified.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.381-382
• /
• 2007

In this paper, crack detection technique of concrete bridge is proposed robust against shadow and noise. Our technique consists of two steps. In the first step, crack candidate region is detected by preprocessing. Preprocessing techniques such as median filter, isolated point filter and morphological techniques, use utilized for detection of crack candidate regions. In the final step, crack is detected from crack candidate region by considering any connectivity between cracks. By experimental results, performance is improved 6.8% over the existing method.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.13-20
• /
• 2004

In the real-time automatic face recognition technique, accurate face detection is essential and very important part because it has the effect to face recognition performance. In this paper, we use color information, edge information, and binary information to detect candidate regions of eyes from Input image, and then detect face candidate region using the center point of the detected eyes. We verify both eye candidate region and face candidate region using Support Vector Machines(SVM). It is possible to perform fast and reliable face detection because we can protect false detection through these verification process. From the experimental results, we confirmed the Proposed algorithm in this paper shows excellent face detection rate over 99%.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.1-7
• /
• 2023

In this paper, we propose a base address candidate selection method using the $gp register and page granularity as a way to build a static analysis environment for firmware based on MIPS architecture. As a way to shorten the base address search time, which is a disadvantage of the base address candidate selection method through inductive reasoning in existing studies, this study proposes a method to perform page-level search based on the $gp register in the existing base address candidate selection method as a reference point for search. Then, based on the proposed method, a base address search tool is implemented and a static analysis environment is constructed to prove the validity of the target tool. The results show that the proposed method is faster than the existing candidate selection method through inductive reasoning.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.942-952
• /
• 2014

This paper presents a novel test point insertion (TPI) method for a pseudo-random built-in self-test (BIST) to reduce the area overhead. Recently, a new TPI method for BISTs was proposed that tries to use functional flip-flops to drive control test points instead of adding extra dedicated flip-flops for driving control points. The replacement rule used in a previous work has limitations preventing some dedicated flip-flops from being replaced by functional flip-flops. This paper proposes a logic cone analysis-based TPI approach to overcome the limitations. Logic cone analysis is performed to find candidate functional flop-flops for replacing dedicated flip-flops. Experimental results indicate that the proposed method reduces the test point area overhead significantly with minimal loss of testability by replacing the dedicated flip-flops.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2011.02a
• /
• pp.468-468
• /
• 2011

Carbon nanotubes (CNTs) have been considered as one of the promising candidate for next-generation field emitters because of their unique properties, such as high field enhancement factor, good mechanical strength, and excellent chemical stability. So far, a lot of researchers have been interested in field emission properties of CNT itself. However, it is necessary to study proper field emitter shapes, as well as the fundamental properties of CNTs, to apply CNTs to real devices. For example, specific applications, such as x-ray sources, e-beam sources, and microwave amplifiers, need to get a focused electron beam from the field emitters. If we use planar-typed CNT emitters, it will need several focal lenses to reduce a size of electron beam. On the other hand, the point-typed CNT emitters can be an effective way to get a focused electron beam using a simple technique. Here, we introduce a fabrication of CNT fibers with nanoscale point tips which can be used as a point-typed emitter. The emitter made by the CNT fibers showed very low turn-on electric field, high current density, and large enhancement factor. In addition, it showed stable emission current during long operation period. The high performance of CNT point emitter indicated the potential e-beam source candidate for the applications requiring small electron beam size.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.247-256
• /
• 2004

In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.