• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.673-674
• /
• 2009

전자신분증 시스템을 구현하기 위해서는 여러 가지 보안요소들이 고려되어야 한다. 본 논문에서는 Hash Tree와 Keyed Hash를 이용하여 전자신분증 시스템에 효율적으로 적용될 수 있는 메시지 인증(Message Authentication) 프토토콜을 제안한다.

• Journal of Platform Technology
• /
• 제10권2호
• /
• pp.3-9
• /
• 2022

In this paper, to maximize the performance of the scatter communication in multi-core and many-core processors, a technique that considers the communication situation of the processing node is applied to a multi-core processor composed of 32 processing nodes. Since the existing scatter algorithm cannot recognize the communication conditions of the processing nodes, communication is generally performed according to an initially set transmission order. In this case, scatter communication starts only after the communication currently being performed by all processing nodes inside the processor is finished. The scatter communication performance was improved by this technique, and it was confirmed that there was a performance improvement of up to 78.93% compared to the existing algorithm through BFM simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• 제14권2호
• /
• pp.77-81
• /
• 2013

The international standard AIS, which stands for the safety of ship navigation and vessel traffic management, provides 27 messages to exchange the navigational information of ship. Among 27 messages, message ID 6 and 8 are defined as the binary data format to exchange application specific information and are classified into IFM for international use and RFM for national or regional use. Since international standards are based on English, there have been some needs to exchange data in Hangul text for vessel traffic management to correct the static and dynamic ships' information. In this paper, I analyze international standards to provide a Hangul text messaging service based on RFM and propose a RFM message and a simple protocol to correct information of a ship.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.229-232
• /
• 2001

This paper has analyzed an architecture of DSLAM, system software Architecture, an external interface of DSLAM module, Message transfer of each task. Also in this paper, message and structures between SNMP Agent and each internal board are defined, and from the defined messages and data structures, message processing between boards is designed and implemented

• The KIPS Transactions:PartA
• /
• 제15A권2호
• /
• pp.87-94
• /
• 2008

Message races should be detected for debugging effectively message-passing programs because they can cause non-deterministic executions of a program. Previous tools for detecting message races report that message races occur in every receive operation which is expected to receive any messages. However message races might not occur in the receive operation if each of messages is transmitted through a different logical communication channel so that their incorrect detection makes it a difficult task for programmers to debug programs. In this paper we suggest a tool, MPIRace-Check, which can exactly detect message races by checking the concurrency between send/receive operations, and by inspecting the logical communication channels of the messages. To detect message races, this tool uses the vector timestamp to check if send and receive operations are concurrent during an execution of a program and it also uses the message envelop to inspect if the logical communication channels of transmitted messages are the same. In our experiment, we show that our tool can exactly detect message races with efficiency using MPI_RTED and a benchmark program. By detecting message races exactly, therefore, our tool enables programmers to develop reliable parallel programs reducing the burden of debugging.

• The Transactions of the Korea Information Processing Society
• /
• 제5권11호
• /
• pp.2855-2861
• /
• 1998

Election is a fundamental problem in the distributed computing. We consider n nodes in the network with f maximum number of faulty links incident on each node, where $f{\le}{\llcorner}(n-1/2){\lrcorner}$. In general, electing a leader, finding the maximum identifier and constructing a spanning tree belong to the same class in the distributed computing because of the same order of the message complexity. Using a spanning tree, we prove that the lower bound of message complexity for a leader election algorithm in an asynchronous complete network with intermittent link faults is $O(n^3)$.

• The Transactions of the Korea Information Processing Society
• /
• 제7권6호
• /
• pp.1874-1885
• /
• 2000

When a receiver of ciphertext message can not decrypt a message because he has lost his private-key, the private-key of receiver and session-key of the message should be recovered. In this paper, we developed an Encapsulation based Key Recovery System (EKRS). EKRS is a new key encapsulation based key recovery system which is characterized by secretly choice of KRA, randomized target keys. n-way recovery type, and useful for commercial key recovery. EKRS is formally specified by a pictorial model, an Extended Cryptographic Timed Petri Net (ECTPN). Secure information flow and reachability of a session-key are verified by using reachability graph of ECTPN. EKRS, executing over a Public Key Infrastructure, can be used as a security solution in Web based applications such as CALS, EC an EDI.

• Journal of Information Processing Systems
• /
• 제10권3호
• /
• pp.483-490
• /
• 2014

In today's world, communication, the sharing of information, and money transactions are all possible to conduct via the Internet, but it is important that it these things are done by the actual person. It is possible via several means that an intruder can access user information. As such, several precautionary measures have to be taken to avoid such instances. The purpose of this paper is to introduce the idea of a one-time password (OTP), which makes unauthorized access difficult for unauthorized users. A OTP can be implemented using smart cards, time-based tokens, and short message service, but hardware based methodologies require maintenance costs and can be misplaced Therefore, the quick response code technique and personal assurance message has been added along with the OTP authentication.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.223-224
• /
• 2009

A wireless ad hoc network is a decentralized wireless network. The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. In this paper, we proposed new route maintenance algorithm to improve the efficiency and effective in order to reach destination node. In this algorithm we improve existing route maintenance in Dynamic Source Routing protocol, to improve the algorithm we make a new message we call Emergency Message (EMM). The emergency message used by the node moved to provide information of fault detection.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.956-959
• /
• 2011

When SOAP message in Web Services has sensitive and important data, it is necessary to protect the message from XML rewriting attacks. These attacks create a foundation for typical faults in SOAP message and make it vulnerable to use in Web Service environment. Currently, Web Services middleware offers limited functions to detect these faults and possibly fix them. In this paper, we propose a Security Description Assistance which identifies and fixes typical faults in SOAP messages. Our system adapts simulation-based approach, which allows system to self-optimize its performance in different conditions and thus improve the reliability of Web Services.