• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1135-1136
• /
• 2008

Error correcting codes (ECC) are widely used in all types of memory in industry, including caches and embedded memory. The focus in this paper is on studying of power consumption in memory ECCs circuitry that provides single error correcting and double error detecting (SEC-DED) designed by various evolution strategies. The methods are applied to two commonly used SEC-DED codes: Hamming and odd column weight Hsiao codes. Finally, we conduct some simulations to show the performance of the various methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.163-165
• /
• 2016

AES-128 블록 암호에 대해 상관관계 전력분석 공격을 통해 비밀키를 추출할 수 있는 보안공격 시스템의 프로토타입을 개발했다. Verilog HDL로 모델링된 AES-128 암호 코어의 RTL 시뮬레이션을 통해 switching activity 정보를 추출하고, 이를 PowerArtist 툴을 이용하여 순시 전력을 도출하였다. 추출된 순시 전력으로부터 출력 레지스터의 hamming Weight 모델링과 상관관계 분석을 통해 128 비트의 비밀키 중 일부를 획득하는 보안공격 시스템을 개발하였다.

• International Journal of Advanced Culture Technology
• /
• v.5 no.1
• /
• pp.76-82
• /
• 2017

An image hash, a discriminative and robust summary of an image, should be robust against quality-preserving signal processing steps, while being pairwise independent for perceptually different inputs. In order to improve the hash matching performance, this paper proposes a probabilistic dissimilarity matching. Instead of extracting the binary hash from the query image, we compute the probability that the intermediate hash vector of the query image belongs to each quantization bin, which is referred to as soft quantization binning. The probability is used as a weight in comparing the binary hash of the query with that stored in a database. A performance evaluation over sets of image distortions shows that the proposed probabilistic matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.390-393
• /
• 2014

The importance of this emerging information security and u-Korea or ubiquitous IT era, and the information security is more important. Especially, the small core device password encryption algorithm is an important part of the secure side channel attack cryptographic algorithms. However, it can provide high level of security, an adversary can attack small core device through implementation of cryptographic algorithms. In this paper describes for the Power Analysis attack and analyze the experimental environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.663-666
• /
• 2013

부채널 분석은 암호 기기가 노출하는 물리적 정보를 이용하여 키를 찾아내는 분석 기법이다. 이러한 부채널 분석의 대응 방안으로 마스킹, 셔플링과 같은 기술이 연구되어지고 있다. 그러나 이러한 대응 기법들 역시 2차 전력 분석에 취약점을 가지고 있다. 이 때, 일반적인 2차 전력 분석 기법의 이론적 분석 성능은 잡음의 영향을 받는 실제 분석 환경에서 현저하게 줄어드는 것을 알 수 있다. 본 논문에서는 2차 전력 분석의 분석 성능을 향상시키기 위해 기존의 탐지된 전력 정보를 직접 활용하지 않고, 전력 소모량을 헤밍웨이트로 대응시켜 이론적 계산 값과의 근사치를 높이는 방법을 제안한다. 실험 결과 일반적인 2차 전력 분석 기법에 비해 약 8%의 성능 향상을 보였다. 또한 전력 소모량과 중간 값 사이의 상관도를 높이기 위해 변환된 헤밍웨이트를 편중시켜 분석한 결과, 일반적인 2차 전력 분석 기법에 비해 10~20%의 분석 성능 향상을 가져왔다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.1291-1300
• /
• 2020

Recently, a deep learning-based non-profiling side-channel analysis was proposed. The deep learning-based non-profiling analysis is a technique that trains a neural network model for all guessed keys and then finds the correct secret key through the difference in the training metrics. As the performance of non-profiling analysis varies greatly depending on the neural network training model design, a correct model design criterion is required. This paper describes the two types of loss functions and eight labeling methods used in the training model design. It predicts the analysis performance of each labeling method in terms of non-profiling analysis and power consumption model. Considering the characteristics of non-profiling analysis and the HW (Hamming Weight) power consumption model is assumed, we predict that the learning model applying the HW label without One-hot encoding and the Correlation Optimization (CO) loss will have the best analysis performance. And we performed actual analysis on three data sets that are Subbytes operation part of AES-128 1 round. We verified our prediction by non-profiling analyzing two data sets with a total 16 of MLP-based model, which we describe.

• Journal of the Ergonomics Society of Korea
• /
• v.17 no.1
• /
• pp.47-54
• /
• 1998

Product design and development is very important process in enterprise activities. Reducing development time and reflecting consumer's needs is required to product design and development for increasing benefit and decreasing cost. Human sensibility ergonomics is one of the important technology of R&D in product development. However, the subjective method of human sensibility ergonomics has several problems to analyze and to Quantify experimental data and objective method of human sensibility ergonomics is still in process on study. In this research, new analyzing method is proposed for the subjective human sensibility ergonomics applied with fuzzy set theory. What is the useful theory for controlling uncertain type of information like human mind? This approach is more effective method for analyzing consumer's needs for product design and development process. At collecting needs, certainty scale is added for adapting hedge of fuzzy function. Using a kind of union operator, synthesize each item to analyze identification of each item with fuzzy hamming distance. Identification of analysis is classified with the relational weight using Relationship Chart Method, and is drawn the relationship diagram for clustering each item. A case study with sample test is conducted and demonstrated with this suggested method for more effective way.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.675-678
• /
• 2013

암호 알고리즘이 탑재된 환경에서 암호 알고리즘의 이론적 안전성이 고려되어도 환경에 의존한 부가적 정보를 활용하는 부채널 분석에 대한 안전성이 검토되어야 한다. 최근까지 부채널 분석에 대한 안전성을 고려한 대응기법으로 마스킹 기법이 적용되었으나, 이와는 상반된 개념인 하드웨어 DPL(Dual-rail with Precharge Logic) 기법을 응용한 균일한 해밍웨이트를 제공하는 소프트웨어 AES(Advanced Encryption Standard)가 제안되었다. 최근, 소프트웨어 기반 블록암호에 대해 고차 마스킹 부채널 대응법의 비효율성으로 새로운 방법에 대한 다양한 시도가 되고 있으며, 그 중 균일한 해밍웨이트를 제공하는 표현 방법이 효율적이고 안전한 새로운 대응법으로 검토되어지고 있다. 하지만, 논문에서는 균일한 해밍웨이트 데이터 표현방법 기반 부채널 대응법을 해독하는 차분전력분석 방법을 소개한다. 실험을 통해, AES 128비트 키 중 일부분이 분석됨을 확인하였다. 이는 공격자가 테이블 변환 정보를 활용할 수 있다는 다소 강력한 가정하에 실험하였기 때문이다. 앞선 가정 하에 안전성을 제공하기 위해서는 차후 추가적 대응기법이 고려되어야 한다.

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

• Journal of IKEEE
• /
• v.26 no.3
• /
• pp.506-509
• /
• 2022

In a secret sharing scheme, secret information must be distributed and stored to users, and confidentiality must be able to be reconstructed only from an authorized subset of users. To do this, secret information among different code words must not be subordinate to each other. The minimal code is a kind of linear block code to distribute these secret information not mutually dependent. In this paper, we present a novel extension technique for minimal codes. The product of an arbitrary vector and a minimal code produces a new minimal code with an extended length and Hamming weight. Accordingly, it is possible to provide minimal codes with parameters not known in the literature.