• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.209-217
• /
• 2022

Naval CMS(Combat Management System) is linked to various sensors and weapon equipment and use DDS(Data Distribution Service) for efficient data communication between ICU(Interface Control Unit) Node and IPN(Information Processing Node). In order to use DDS, software in the system communicates in an PUB/SUB(Publication/Subscribe) based on DDS topic. If the DDS messages structure in this PUB/SUB method does not match, problems such as incorrect command processing and wrong information delivery occur in sending and receiving application software. To improve this, this paper proposes a DDS message structure integrity verification method. To improve this, this paper proposes a DDS message structure integrity verification method using a hash tree. To verify the applicability of the proposed method to Naval CMS, the message integrity verification rate of the proposed method was measured, and the integrity verification method was applied to CMS and the initialization time of the existing combat management system was compared and the hash tree generation time of the message structures was measured to understand the effect on the operation and development process of CMS. Through this test, It was confirmed that the message structure verification method for system stability proposed in this paper can be applied to the Naval CMS.

• Korean Journal of Remote Sensing
• /
• v.16 no.2
• /
• pp.145-156
• /
• 2000

Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.875-883
• /
• 2010

In this paper, we present a secure biometric hashing scheme for face recognition by random fusion of global and local features. The Fourier-Mellin transform and Radon transform are adopted respectively to form specialized representation of global and local features, due to their invariance to geometric operations. The final biometric hash is securely generated by random weighting sum of both feature sets. A fourfold key is involved in our algorithm to ensure the security and privacy of biometric templates. The proposed biometric hash can be revocable and replaced by using a new key. Moreover, the attacker cannot obtain any information about the original biometric template without knowing the secret key. The experimental results confirm that our scheme has a satisfactory accuracy performance in terms of EER.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2061-2068
• /
• 2016

A Bloom filter is a space-efficient data structure popularly applied in many network algorithms. This paper proposes a vectored Bloom filter to provide a high-speed Internet protocol (IP) address lookup. While each hash index for a Bloom filter indicates one bit, which is used to identify the membership of the input, each index of the proposed vectored Bloom filter indicates a vector which is used to represent the membership and the output port for the input. Hence the proposed Bloom filter can complete the IP address lookup without accessing an off-chip hash table for most cases. Simulation results show that with a reasonable sized Bloom filter that can be stored using an on-chip memory, an IP address lookup can be performed with less than 0.0003 off-chip accesses on average in our proposed architecture.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.175-178
• /
• 2005

인터넷 상의 불특정 다수의 컴퓨팅 자원을 연계하여 오버레이 네트워크를 구성하여 새로운 컴퓨팅 인프라를 구성하려는 분산 해쉬 테이블 (Distributed Hash Table)방식의 Peer-to-Peer(P2P) 네트워크 관련 연구가 진행되고 있다. DHT 방식의 P2P네트워크는 자원의 복제 및 공유하여 컴퓨팅 시스템 전반에 걸친 신뢰성과 결함 감내 능력을 향상시키는 장점이 있는 반면에 하부 네트워크 정보를 무시하기 때문에 전체 시스템 구성 및 메시지 전송에 있어 실제적인 성능상의 문제점을 드러낸다. 이 논문에서는 하부 네트워크의 구성 정보를 이용하여 DHT 기반의 P2P 네트워크의 메시지 전송 방식의 효율을 높이는 방법을 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.754-756
• /
• 2003

많은 디지털 서명 알고리즘들이 제안되었지만, 내제된 위험 요소들은 여전히 해결되지 않고 있다. 그 중 해쉬 함수의 충돌(Collision)문제가 있는데, 중요한 것은 이 문제로 인해 메시지가 일단 위조되면 어느 누구도 그 메시지의 위법성을 증명할 수 없다는 것이다. 따라서, 본 논문에서는 이 문제를 해결하는 방법에 대해 연구하고 새로운 디지털 서명 방식을 제안한다. 제안된 디지털 서명 방식은 해쉬(Hash) 알고리즘의 안전성 정도에 상관없고 오직 공개키 암호의 안전성에 연관되기 때문에 계산 속도가 빠른 해쉬 알고리즘을 사용할 수 있다. 또한, 이 방식은 기존 디지털 서명 알고리즘과 함께 사용될 수 있어서 E-commerce를 더욱 활성화시킬 것으로 예상된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.277-279
• /
• 2013

스크램블링(Scrambling)은 네트워크에서 영상을 전송할 때 보안을 위해 데이터를 특정한 키에 의해 암호화 하여 전송함으로써, 수신자만이 원본 영상으로 복원할 수 있도록 하는 기술이다. 스크램블링은 전송에서 TDES, AES 뿐만아닌 SEED, AIRA의 암호화 알고리즘을 사용한다. 이 경우 암복호화에 많은 시간이 소요되어 실시간 전송환경에서는 전송속도 저하에 따른 QoS 문제가 발생한다. 이와 같은 문제를 해결하기 위해 기존 연구에서는 속도가 빠른 해쉬 함수를 이용하여 스크램블링 암호화 하는 기법을 제안하였다. 하지만 원본 이미지의 일부가 노출될 경우 이후 원본프레임이 노출될 수 있는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 방지하기 위해 다중 해쉬 키 프레임을 이용한 Multi Hash key Frame based Scrambling Encryption 알고리즘을 제안한다. 성능평가에서는 제안하는 스크램블링 기법에 대한 암복호화 비용과 성능을 측정하였으며, 기존기법과 비교하였을 때 원본 노출로 인한 대입공격 취약성 부분을 기존 해쉬 함수의 보안 안전성만큼 향상시켰다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.8 no.4
• /
• pp.111-126
• /
• 1998

이동통신에서의 사용자 인증 서비스는 통화도용 방지와 신뢰성 있는 과금을 위한 중요한 보호서비브이다. 본 논문에서는 해쉬 함수를 개발하고 이를 IS-95A 인증시스템의 인증 알고리듬과 인증 키생성 알고리듬을 적용하였다. 특히 인증 알고리듬을 활용하여 인증 키 생성알고리듬을 oracle 해쉬함수의 형태로 구현함으로써 인증 시스템의 높은 안전성과 간결성ㅇ르 동시에 성취하였다. 그리고 통계적분석 기법을 사용하여 개발된 알고리듬의 출력 특성을 분석한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.217-228
• /
• 2011

In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.961-964
• /
• 2000

With the advance of wireless communications technology, mobile communications has become more convenient than ever. However because of the openness of wireless communications, how to protect the privacy between communicating parties is becoming a very important issue. In this paper an authentication and encryption algorithm of the GSM network for roaming user is proposed. In the proposed algorithms, we use a new hash function for user authentication and LFSR (Linear Feedback Shift Register) based stream cipher for message encryption and decryption. Each algorithm is programmed with C language and simulated on IBM-PC system and we analyze the randomness properties of the developed algorithm using statistical analysis.