• ETRI Journal
• /
• 제43권4호
• /
• pp.746-757
• /
• 2021

Side-channel attacks pose an inevitable challenge to the implementation of cryptographic algorithms, and it is important to mitigate them. This work identifies a novel data encoding technique based on 1-of-4 codes to resist differential power analysis attacks, which is the most investigated category of side-channel attacks. The four code words of the 1-of-4 codes, namely (0001, 0010, 1000, and 0100), are split into two sets: set-0 and set-1. Using a select signal, the data processed in hardware is switched between the two encoding sets alternately such that the Hamming weight and Hamming distance are equalized. As a case study, the proposed technique is validated for the NIST standard AES-128 cipher. The proposed technique resists differential power analysis performed using statistical methods, namely correlation, mutual information, difference of means, and Welch's t-test based on the Hamming weight and distance models. The experimental results show that the proposed countermeasure has an area overhead of 2.3× with no performance degradation comparatively.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.463-466
• /
• 2003

Fuzzy set expressing category in fuzzy rating, which is a kind of psychological scaling, is dependent on situations. This paper assumes that a mapping exists between fuzzy sets expressing categories in some situation and those expressing same categories in another situation. fuzzy sets expressing categories in some situation are obtained by fuzzy sets expressing categories in another situation and the mapping between them. The usefulness of the present method is confirmed by the experiments comparing fuzzy sets obtained by the presented method with those identified directly by fuzzy rating. The normalized distance is used to compare both fuzzy sets and the experimental results show that the normalized distances between both fuzzy sets are enough small and that the presented method is useful for psychological scaling.

• Genomics & Informatics
• /
• 제17권4호
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.

• International Journal of Contents
• /
• 제11권2호
• /
• pp.9-14
• /
• 2015

We propose a new distance measure between 2-dimensional points to provide a total order for an entire point set and to reflect the correct geometric meaning of the naturalness of the point ordering. In general, there is no total order for 2-dimensional point sets, so curve reconstruction algorithms do not solve the self-intersection problem because the distance used in the previous methods is the Euclidean distance. A natural distance based on Brownian motion was previously proposed to solve the self-intersection problem. However, the distance reflects the wrong geometric meaning of the naturalness. In this paper, we correct the disadvantage of the natural distance by introducing a polar-natural distance, and we also propose a new curve reconstruction algorithm that is based on the polar-natural distance. Our experiments show that the new distance adequately reflects the correct geometric meaning, so non-simple curve reconstruction can be solved.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 춘계학술대회 학술발표 논문집 제16권 제1호
• /
• pp.365-369
• /
• 2006

구간치 퍼지집합은 Gorzalczang(1983)과 Turken(1986)에 의해 처음 제의되었다. 이를 토대로 Wang과 Li는 구간치 퍼지수에 관한 연산으로 일반화 하여 연구하였다. 최근에 홍(2002)는 왕과 리의 이론을 리만적분에 의해 구간치 퍼지집합상의 거리측도에 관한 연구를 하였다. 우리는 일반측도와 관련된 리만적분 대신에 퍼지측도와 관련된 쇼케이적분을 이용한 구간치 퍼지수 상의 쇼케이 거리측도를 연구하였다(2005). 본 논문에서는 퍼지수에서 퍼지수로의 쇼케이 거리측도를 정의하고 이와 관련된 성질들을 조사하였다.

• 한국컴퓨터정보학회논문지
• /
• 제12권2호
• /
• pp.71-76
• /
• 2007

주어진 영상 내에서 의미 있는 객체의 존재여부를 판단하는 객체검출과정은 컴퓨터 비전 시스템을 이용한 영상인식의 핵심요소 가운데 하나이다. 템플릿 정합 방식의 객체 검출방식에서 사용되어 얼굴 인식 등에서 좋은 성능을 보이는 Hausdorff 거리는 점의 집합으로 표현된 두 객체 사이의 다른 정도를 정의함으로써 주어진 모델과 가장 차이가 적은 객체를 검출하도록 한다. 본 논문에서는 일반적으로 사용되는 바와 같이 점의 집합이 영상의 에지를 검출하여 얻어진 경우, 에지가 가지고 있는 방향정보를 이용함으로써 검출의 정확성을 높일 수 있는 방법을 제안하고 있다. 일반적으로 사용되는 Euclidean 거리 대신에 방향을 가진 두 점을 일치시키는데 필요한 탄성에너지를 정의함으로써 검출의 정확성을 높이는 방법을 제시하고 있다.

• 충청수학회지
• /
• 제11권1호
• /
• pp.45-51
• /
• 1998

In this paper, we shall define the usual fuzzy distance between two real fuzzy points, using the usual distance between two points in $\mathbb{R}$. We introduce the fuzzy sequence in the fuzzy real line and the notion of limit of fuzzy sequence in $F_p(\mathbb{R})$, and obtain the fuzzy increasing(decreasing) sequence and fuzzy Cauchy sequence of real fuzzy points.

• 전자공학회논문지S
• /
• 제34S권11호
• /
• pp.93-101
• /
• 1997

A Hausdorff distance (HD) is one of commonly used measures for object matching. It calculates the distance between two point sets of edges in two-dimensional binary images without establishing correspondences. This paper proposes three object matching algorithm using robust HD measures based on M-estimation, least trimmed square (LTS), and .alpha.-trimmed mean methods, which are more efficient than the conventional HD measures. By computer simulation with synthetic and real images, the matching performance of the conventional HD smeasures and proposed' robust ones is compared.

• Communications for Statistical Applications and Methods
• /
• 제3권2호
• /
• pp.13-19
• /
• 1996

Cook's distance(Cook, 1997) is one of the most widely used influence measures to assess the influence of single observations or sets of observations in the linear regression model. After computing Cook(1977) suggested guidelines based on a confidence ellipsoid for the regression parameter ${\beta}$. In this paper, we suggest cutoff values for Cook's distance cia Monte Carlo simulation, and compare them with Cook's guidelines. An example based on a real data set is given.

• 한국항해항만학회지
• /
• 제27권3호
• /
• pp.273-282
• /
• 2003

This paper proposes a sensor-fusion technique where rho data sets for the previous moments are properly transformed and fused into the current data sets to enable accurate measurement, such as, distance to an obstacle and location of the service robot itself. In the conventional fusion schemes, the measurement is dependent only on the current data sets. As the results, more of sensors are required to measure a certain physical promoter or to improve the accuracy of the measurement. However, in this approach, intend of adding more sensors to the system, the temporal sequence of the data sets are stored and utilized for the measurement improvement. Theoretical basis is illustrated by examples md the effectiveness is proved through the simulation. Finally, the new space and time sensor fusion (STSF) scheme is applied to the control of a mobile robot in the indoor environment and the performance was demonstrated by the real experiments.