• Journal of the Korea Society for Simulation
• /
• v.28 no.4
• /
• pp.67-74
• /
• 2019

As the market for Internet of Things (IoT) service grows, the security issue of the data from IoT devices becomes more important. In this paper, we implemented a cryptographic library for confidentiality of sensor data from Android Things based IoT services. The library made use of the SEED algorithm for encryption/decryption of data and we verified the library by implementing a service environment. With the library, the data is securely encrypted and stored in the database and the service environment is able to represent the current sensing status with the decrypted sensor data. The contribution of this work is in verifying the usability of SEED based encryption library by implementation in IoT sensor based service environment.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.1
• /
• pp.15-23
• /
• 2016

As various IoT devices appear recently, Cloud Services such as DropBox, Amazon S3, Microsoft Azure Storage, etc are widely use for data sharing across the devices. Although, cryptographic algorithms like AES is prevalently used for data security, there is no mechanisms to allow selectively and flexibly use wider spectrum of lightweight cryptographic algorithms such as LEA, SEED, ARIA. With this, IoT devices with lower computation power and limited battery life will suffer from overly expensive workload and cryptographic operations are slower than what is enough. In this paper, we designed and implemented a CloudGate that allows client programs of those cloud services to flexibly select a cryptographic algorithms depending on the required security level. By selectively using LEA lightweight algorithms, we could achieve the cryptographic operations could be maximum 1.8 faster and more efficient than using AES.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.65.1-70
• /
• 2000

최근 인터넷 사용자의 증가와 인터넷을 이용한 전자상거래가 활발해지면서 TCP/IP 통신 보안에대한 많은 연구들이 진행되고 있다. 이러한 연구들중 SSL(Secure Socket Layer) 은 인증 및 보안 프로토콜로서 인터넷을 이용한 통신 보안에 가장 많이 사용되고있는 방법이다. 본 논문에서는 국내 암호 알고리즘의 표준으로 채택된 SEED 알고리즘을 SSL에 적용하여 서버와 클라이언트의 통신을 128bits 암호화할 수 있는 SSL-Proxy 프로그램을 구현하였으며, Windows 와 Unix 시스템에 모두 적용 가능하도록 모듈화하였다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.223-227
• /
• 2001

보안을 위한 암호화는 실시간 통신인 VoIP에 패킷의 추가적인 작업이 요구되므로 음질에 악영향을 미치게 된다. 이러한 영향을 파악하고 분석하기 위해 DES, 3DES, SEED 그리고 AES 등의 암호 알고리즘을 VoIP 시스템에 적용하여 지터나 RTT 혹은 패킷 손실율과 같은 QoS 요소를 측정함으로써 각 암호 알고리즘의 연산이 실시간 통신에 미치는 영향을 알아보았다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.417-419
• /
• 1998

캘리브레이션이란 회전요소, 이동요소, 크기요소 값을 이용하여 한 영상을 변형시킴으로서 두 영상간의 부분적으로 동일한 영역이 오버랩 되도록 하는 작업을 말한다. 본 논문에서는 두 영상의 캘리브레이션을 위한 하나의 방법으로서 히스토그램을 작성하고, 이를 토대로 설정된 임의의 그레이 레벨에 해당하는 화소들은 seed로 하여 영역확장을 수행한 후, 대응하는 영역사이에 매칭을 행함으로서 회전요소 값, 이동요소 값, 크기요소 값을 구한다. 또한 실험을 텅해 얻은 각 요소값과 실제값을 비교함으로서 본 알고리즘의 성능을 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.875-877
• /
• 2015

IoT 환경의 센서 네트워크와 RFID 태그 등에서의 AES나 SEED에 대응 할 수 있는 새로운 저전력 경량화 암호 알고리즘이 필요 해짐에 따라 본 논문에서는 2006년 국내에서 제안된 HIGHT와 2007년 CHES에서 제안된 PRESENT 알고리즘을 Arduino에 적용하여 성능을 비교분석 하였다. 그 결과 HIGHT 알고리즘이 PRESENT알고리즘에 비하여 더 짧고, 적은 수행시간과 프로그램 메모리 사용량을 보였으며, 더 많은 동적 메모리 사용량을 보였다.

• Journal of Bio-Environment Control
• /
• v.13 no.2
• /
• pp.90-95
• /
• 2004

This study was conducted to develop an algorithm for the embryo location in seed by using machine vision. The topic of this research is to detect the embryo location in seed regardless of seed supply direction. In order to detect the embryo location in Cham Bak, Tuktojwa and Hukjong, the effect of seed posture in the supply line was investigated. When the seed posture angle of Chambak from horizontal direction was $30^{\circ}$, the detection accuracy for embryo location was 77.8%, while detection accuracy was 100% for the $0^{\circ}$ or $15^{\circ}$. When seed posture angle of Tuktojwa was $30^{\circ}$ from the horizontal direction, the detection accuracy was 89.5% and it was 100% for the $0^{\circ}$ and $15^{\circ}$. Embryo location detection accuracy for the Hukjong was 94.4% when the seed posture angle from the horizontal direction is $30^{\circ}$, and it was 100% for the $0^{\circ}$ and $15^{\circ}$. When seeds are fed into the posturing and seeding line, the seed postures within $30^{\circ}$ with mechanical means, and at most $15^{\circ}$ seed stand posture. the developed algorithm can detect the embryo position in the seed. So, this embryo detection system is very useful tool in the posturing and seeding line.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.661-664
• /
• 2003

Trade-off of sorority and speed always exists in the latest network environment. Recently, developed security processors is improved very performance, and sorority connection algorithms of a lot of part were embodied by hardware. This high speed security processor is essential ingredient in string network security solution equipment development that require very big band width. In this paper, we wish to describe about design and implementation of 10 Giga VPN equipments. In this system, embodied 10 Giga to use Cavium company's Nitrox-II processor, and supports two SP14-2 interface and PCI interface. All of the password algorithm that password algorithm that support is used in common use VPN equipment for compatibility with common use VPN equipment are supported and support SEED algorithm developed in domestic. Designed to support IPsec and SSL protocol, and supports all of In-Line structure that is profitable in high speed transaction and the Look-Aside structure that is profitable in practical use degree of NPU(Network Processor Unit).

• Convergence Security Journal
• /
• v.18 no.4
• /
• pp.27-33
• /
• 2018

Stream cipher is an one-time-pad type encryption algorithm that encrypt plaintext using simple operation such as XOR with random stream of bits (or characters) as symmetric key and its security depends on the randomness of used stream. Therefore we can design more secure stream cipher algorithm by using mathematical analysis of the stream such as period, linear complexity, non-linearity, correlation-immunity, etc. The key stream in stream cipher is generated in linear feedback shift register(LFSR) having characteristic polynomial. The primitive polynomial is the characteristic polynomial which has the best security property. It is used widely not only in stream cipher but also in SEED, a block cipher using 8-degree primitive polynomial, and in Chor-Rivest(CR) cipher, a public-key cryptosystem using 24-degree primitive polynomial. In this paper we present the concept and various properties of primitive polynomials in Galois field and prove the theorem finding the number of irreducible polynomials and primitive polynomials over $F_p$ when p is larger than 2. This kind of research can be the foundation of finding primitive polynomials of higher security and developing new cipher algorithms using them.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.359-368
• /
• 2002

In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was $(15\times{5)}$ through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.