• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1164-1174
• /
• 1992

In this paper, an Information Security protocol in LLC/MAC Layer Architecture is discussed. This paper examines the security Vulnerability and threats, the security Service required to protect these threats, and architectural considerations of security protocol in IEEE 802 LAN architecture. To provide an Information security service, an information security protocol(SP2 : Security Protocol 2) PDU construction with LLC/MAC service primitives is suggested. To construct the SP2 protocol, the ECB, CBC mode of DES algorithm and DAA(Data Authentication Algorithm) of FIPS is used. The SP2 protocol suggested in this paper provides data origin authentication, data confidentiality, data integrity service.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1941-1954
• /
• 1999

This paper presents a design and implementation of CRs(CHILL Run-time support System) to adapt the concurrent processing facilities of CHILL(CCITT High Level Language) which had recommended by ITU-T(International Telecommunication Union Telecommunication Standardization Sector). Because the CHILL provides more various concurrent processing facilities that other concurrent programming language, a design and implementation on CRS can give us real effects to gain the major functionalities and the techniques of the concurrent processing. In this paper, we design the interface rules of concurrent functions to conform with the CHILL compiler. We use the concurrent processing primitives as the library style to be invoked by procedure calls, and implement the start-up routine of the CHILL program, the context switching routine, and the CHILL process control parts to control be execution of the CHILL processes concurrently.

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

최근의 대용량 DEM 데이터는 실시간 렌더링을 하기엔 많은 양의 폴리곤을 필요로 한다. 사진 트리는 이러한 DEM 데이터를 실시간에 렌더링 하기 위해 지형 메쉬를 간략화하는데 널리 사용되는 자료구조이다. 트리구조는 재귀 연산 및 포인터 연산과 같이 GPU 에서 제공하지 않는 기능을 필요로 하기 때문에 일반적으로 CPU 상에서 구현되어 사용된다. GPU 에서 사진 트리 삼각화 기법을 사용하기 위해서 기존의 연구에서는 정점 프리미티브와 스트림 출력 단계를 이용하였다. 하지만 이 방법은 매 프레임 루트 노드부터 리프 노드까지 탐색을 하며 지형 메쉬를 새로 생성 해야하기 때문에 불필요한 연산이 많다. 제안하는 방법은 핑퐁 버퍼를 이용하여 이전 프레임에서 사용한 지형 메쉬를 다음 프레임에서 재활용하여 기존 GPU 기반 사진 트리 삼각화 기법을 가속화한다. 기존 방법이 매 프레임 사각형 패치를 세분화 하면서 지형 메쉬를 생성하는 대신 제안하는 방법은 이전 프레임에서 사용한 메쉬의 각 패치들을 병합하거나 세분화하는 방법을 사용한다. 따라서 본 방법은 GPU 기반 사진 트리 삼각화의 재귀 호출을 제거하여 연산량을 줄이고 매 프레임 CPU-GPU 간의 데이터 전송량도 효율적으로 줄여 기존의 방법을 효율적으로 가속화 한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.4
• /
• pp.139-146
• /
• 2006

A Signcryption proposed by Yuliang Zheng in 1997 is a hybrid public key primitive that combines a digital signature and a encryption. It provides more efficient method than a straightforward composition of an signature scheme with a encryption scheme. In a mobile communication environment, the authenticated key agreement protocol should be designed to have lower computational complexity and memory requirements. The password-based authenticated key exchange protocol is to authenticate a client and a server using an easily memorable password. This paper proposes an secure Authenticated Key Exchange protocol using Signcryption scheme. In Addition we also show that it is secure and a more efficient that other exiting authenticated key exchange protocol.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.569-572
• /
• 2022

본 논문에서는 공기 메쉬(Air meshes)를 이용하여 고체의 충돌을 효율적으로 처리할 수 있는 새로운 방법을 제시한다. 기존의 프리미티브 단위의 충돌 처리는 시뮬레이션의 안정성을 높이기 위해 시간 간격(Time-step), 3차 방정식과 같은 큰 계산 과정을 필요로 했으며, 장면 복잡도에 따라 DCD(Discrete collision detection)뿐만 아니라 CCD(Continuous collision detection)까지 고려해야 되는 상황이 빈번히 발생한다. 본 논문에서는 이전에 제안된 공기 메쉬 기법을 통해 충돌처리를 효율적으로 개선시킬 수 있는 방법에 대해서 제안한다. 원본 공기 메쉬 접근법은 시뮬레이션 메쉬가 아닌, 주변 공기를 메쉬화시키고 이들의 변형을 부피로 근사하여 충돌 여부 및 처리를 인지하고 예측했다. 공기 메쉬를 정제하는 과정에서 수치적인 수렴을 위해 정삼각형을 유지하려는 제약사항을 두었다. 하지만, 이러한 방법은 장면에 따라 노이즈한 결과를 나타내며, 헤어나 털 시뮬레이션과 같은 라인 형태인 시뮬레이션에서는 경계 문제가 더욱더 민감하게 나타났다. 본 논문에서는 공기 메쉬를 정제하는 과정에서 새로운 제약 조건을 추가하여 노이즈가 완화된 충돌처리 결과를 보여준다. 우리의 헤어뿐만 아니라 대부분의 장면에서 안정적인 결과를 보여준다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1106-1120
• /
• 1997

In this paper,we prosent a new run-time support system for SR usitn POSIX threads (Pthreads),called SR/RTS +.SR supports a rich set of concurent programming techniques with multiple cincurrency control primit-ives Since the original RTS for SR uses its own thread management facility,it should be modifide to work on different computer systems.Furthermore,the run-time efficiency of the RTS should be considered in association with those different sytems.Thus,to portability and to guarantee the predictable run-time ef-ficiency,SR/RTS + is designed on the pthreads(POSIX Threads )which supports multiple threads of con-trol within a single POSIX process.Also, the SR compiler is modified to generate the codes appropriate for pthreads interface.SR/RTS + has been develped on Spare Workstation using pthreads library announced by Florida State University and tested with the SR verification suite distribute by the University of Arizona.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.9
• /
• pp.73-84
• /
• 2004

This paper suggests a new scalar multiplication algerian to resist SPA which threatens the security of cryptographic primitive on the hardware recently, and discusses how to apply this algerian Our algorithm is better than other SPA countermeasure algorithms aspect to computational efficiency. Since known SPA countermeasure algorithms have dependency of computation. these are difficult to construct parallel architecture efficiently. To solve this problem our algorithm removes dependency and computes a multiplication and a squaring during inversion with parallel architecture in order to minimize loss of performance. We implement hardware logic with VHDL(VHSIC Hardware Description Language) to verify performance. Synthesis tool is Synplify Pro 7.0 and target chip is Xillinx VirtexE XCV2000EFGl156. Total equivalent gate is 60,508 and maximum frequency is 30Mhz. Our scalar multiplier can be applied to digital signature, encryption and decryption, key exchange, etc. It is applied to a embedded-micom it protects SPA and provides efficient computation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.1
• /
• pp.31-39
• /
• 2016

Hash function is a cryptographic primitive which conduct authentication, signature and data integrity. Recently, Wang et al. found collision of standard hash function such as MD5, SHA-1. For that reason, National Security Research Institute in Korea suggests a secure structure and efficient hash function, LSH. LSH consists of three steps, initialization, compression, finalization and computes hash value using addition in modulo $2^W$, bit-wise substitution, word-wise substitution and bit-wise XOR. These operation is parallelizable because each step is independently conducted at the same time. In this paper, we analyse LSH structure and implement it over SIMD-SSE, AVX and demonstrate the superiority of LSH.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.133-140
• /
• 2008

This paper proposes an effective k-D tree traversal algorithm for ray tracing on a GPU. The previous k-D tree traverse algorithm based on GPU uses bottom-up searching from a leaf to the root after failing to find the ray intersected primitive in the leaf node. During the bottom-up search the algorithm decides the current node is visited or not from the parent node. In such a way, we need to visit the parent node which was already visited and the duplicated bounding box intersection tests. The new k-D tree traverse algorithm reduces the brother and parent duplicated visit by using an efficient method which decides whether the brother node is already visited or not during the bottom-up search. Also the algorithm take place bounding box intersection tests only for the nodes which is not yet done. As a result our experiment shows the new algorithm is about 30% faster than the previous.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.365-374
• /
• 2005

The B2B electronic product commerce needs intermediary system to provide an integrated interface for the parts libraries of multiple suppliers. However, it is difficult to automatically integrate the parts libraries because they are heterogeneous. Existing ontology-based approaches show a limited functionality of automated integration of information because Dey can not prevent ontologies from being modeled in different ways, so that the inter-ontology mappings to resolve the heterogeneity become complicated and arbitrary. In order to overcome such problems this paper proposes an ontology modeling framework for parts libraries based on the Guarino's theory of upper ontology. The framework provides knowledge modeling primitives which have explicit formal meanings and modeling principles based on ontological natures. Using the framework, ontology developers can model the knowledge of parts libraries systematically and consistently, so that the resulting ontologies become comparable and uniform and the ontology merging algorithm for the automated information integration can be easily developed.