• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.981-984
• /
• 2001

본 논문은 이동물체 영역을 신뢰성 있게 분리하는데 기초가 되는 seed를 정확하게 선정하고, 선정된 seed를 중심으로 영역을 확장함으로써 이동물체 영역을 분리하기 위한 방법을 제안한다. 고정된 카메라로부터 입력되는 연속된 영상열로부터 초기의 이동물체가 존재하지 않는 영상을 참고영상으로 하여 입력영상과의 차영상을 구하고 차영상의 히스토그램에서 배경잡음 모델링을 통해 배경잡음을 제거한다. 그리고 배경잡음이 제거된 차영상에서 Local Maxima 들을 이용해 후보 seed를 선정한 후, 이드의 특징값들을 분석하여 이동물체의 seed와 배경의 seed 를 결정하고 이 두 개의 seed를 기반으로 watershed 알고리즘을 적용하여 영역을 확장함으로써 이동물체 영역을 추출한다. 제안된 방법을 실제 상황에서 얻은 다양한 영상열에 적용한 결과, 기존의 영역분리 알고리즘보다 주위 잡음의 영향을 적게 받으며 효과적으로 이동물체를 분리할 수 있음을 확인할 수 있었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.69-85
• /
• 2003

In this paper, we discuss a validation test for cryptographic algorithms. The cryptographic algorithms decide on the security and the confidence of a security system protecting sensitive information. So. the implementation of cryptographic algorithms is very critical of the system. The validation lest specifies the procedures involved in validating implementations of the cryptographic standards and provides conformance testing for components or procedures of the algorithm. We propose a SEED Validation System(SVS) to verify that the implementation correctly performs the SEED algorithm. The SVS is composed of two types of validation tests, the Known Answer test and the Monte Carlo test. The System generates the testing data for the Known Answer tests and the random data for the Monte Carlo tests. This system can be used to validate and certify the cryptographic product.

• Journal of the Korea society of information convergence
• /
• v.7 no.2
• /
• pp.59-65
• /
• 2014

Grassfire spot matching method is based on similarity comparison of topological patterns for neighbor spots. This is a method where spot matching is performed as if fire spreads all around on grass. Spot matching starts from a seed spot pair confirmed as a matched pair of spots and spot matching spreads to the direction where the best matching result is produced. In this paper, it is a bit complicated way of grassfire method where multi-seed matched spot pair are manually selected and spot matching is performed from each multi-seed matched spot pair. The proposed method shows better performance in detection rate and accuracy than that of the previous method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.4
• /
• pp.739-747
• /
• 2015

Masking technique that is most widely known as countermeasure against power analysis attack prevents leakage for sensitive information during the implementations of cryptography algorithm. it have been studied extensively until now applied on block cipher algorithms. Masking countermeasure have been applied to international standard SEED algorithm. Masked SEED algorithm proposed by Cho et al, not only protects against first order power analysis attacks but also efficient by reducing the execution of Arithmetic to Boolean converting function. In this paper, we analyze the vulnerability of Cho's algorithm against first order power analysis attacks. We targeted additional pre-computation to improve the efficiency in order to recover the random mask value being exploited in first order power analysis attacks. We describe weakness by considering both theoretical and practical aspects and are expecting to apply on every device equipped with cho's algorithm using the proposed attack method.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.2
• /
• pp.51-59
• /
• 2002

In this paper, we studied the voice cryptograph system designed by the SEED algorithm for the safe transmission and receipt on the voice communication. Voice band signal converts to digital signal by the CODEC and DSP that applied the improved SEED algorithm encrypt the digital signal. The CODEC convert Encryption signal into analog voice signal. This voice signal is transmitted safely because of encryption signal even if someone wiretap. Receiver can hear the source voice, because the encryption signal decrypted using the SEED algorithm. In this paper, We designed the 32 round key instead of 16 round key in the SEED algorithm so that we improve the truncated differential probability from $2^{-143.1}$ to $2^{-286.6}$. 

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.215-222
• /
• 2008

In this paper, we analyse eavesdrop problem of existing RFID security scheme and proposed improved SEEB algorithm for RFID security. we suggest partial round process and security in SEED algorithm. Existing scheme has vulnerability of security and implementation so far from realization. Therefore In our paper, we proposed new scheme using modified SEED algorithm for backward channel protection.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.15-29
• /
• 2014

Increasing the smart instrument based social and economical activity, problems of electronic business's safety, reliability and user's privacy are be on the rise. so variety standard cryptography algorithms for information security have been developed in korea and How to efficiently implement them in a variety of environments is issued. ARIA and SEED, developed in Korea, are standard block cipher algorithm to encrypt the 128-bit plaintext, are each configured Feistel, SPN structure. In this paper, SEED and ARIA were implemented using the GEZEL language that can be used easily in the software designer because grammar is simple compared to other hardware description language. In particular, in this paper, will be described in detail the characteristics and design method using GEZEL as the first paper that implements 128bits ARIA and SEED and it showed the flexibility and efficiency of development using GEZEL. SEED designed GEZEL is occupied 69043 slice, is operating Maximum frequency 146.25Mhz and ARIA is occupied 7282 slice, is operating Maximum frequency 286.172Mhz. Also, Speed of SEED designed and implemented signal flow method is improved 296%.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.274-280
• /
• 2003

최근 부채널 공격으로 스마트카드 같은 장치의 비밀키를 알아낼 수 있음이 알려지면서 많은 알고리즘에 대한 부채널 공격과 대응 방안이 연구되고 있다. DPA는 부채널 공격의 일종으로 암호화 연산 중 발생하는 전력 소모 곡선을 통계적으로 분석하여 키를 알아내는 공격이다. 한편 SEED가 국내 표준 블록 암호 알고리즘으로 널리 사용되고 있으나 SEED에 대한 DPA 연구 결과는 발표된 바가 없는 것 같다. 본 논문에서는 SEED에 DPA를 적용할 수 있음을 보이고 대응방안 예를 제시한다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.489-493
• /
• 2003

ebXML, Web Services와 같은 XML을 기반으로 한 프레임워크 기술들이 발전하고 IT 환경이 복잡해지면서 정보보안 기술의 발달과 그 필요성이 더욱 많이 요구되고 있다. UN공식 표준 언어인 XML 문서를 보호화기 위한 보안 메커니즘 가운데 정보의 기밀성을 보장하기 위해 XML 암호화에 대한 관심은 더욱 커지고 있는 상황이지만 XML 암호화 표준 명세에는 국내 표준 암호화 알고리즘인 SEED 암호화 알고리즘은 포함 되어있지 않다. 따라서 ebXML, Web Services등을 국내 표준으로 비준 할 때에 국내 표준암호화의 적용 방안이 필요하므로 본 논문은 국제 표준인 XML 암호화 명세에 국내 표준 암호화 알고리즘인 SEED암호화 알고리즘의 적용방안을 연구한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.41-49
• /
• 2010

Recently, RFID systems are spreading in various industrial areas faster but cause some serious problems of information security because of its unstable wireless communication. Moreover, traditional RFID systems have a restriction that one tag per each application object. This restriction deteriorates their usability because it is difficult to distinguish many tags without some kind of effort. Therefore, efficient information sharing of objects based on information security has to be studied for more spreading of RFID technologies. In this paper, we design a new RFID tag structure for supporting multiple objects which can be shared by many different RFID applications. We also design an encryption/decryption algorithm to protect the identifying information of objects stored in our tag structure. This algorithm is a light revision of the existing SEED algorithm which can be operated in RFID tag environment. To evaluate the performance of our algorithm, we measure the encryption and decryption times of this algorithm and compare the results with those of the original SEED algorithm.