• Cross-Cultural Studies
• /
• v.37
• /
• pp.7-29
• /
• 2014

The 'discovery' or 'conquest' of the New World in 1492 was the starting point of world history that irrevocably changed the fate of the Latin American continent. The global stream known as 'Columbian Exchange', which was the widespread inter-continental contacts, inter-civilizational conflicts, or bilateral communication, has rendered multifarious effects throughout many historical periods up to the very contemporary time. The propagation of Catholicism initiated along with this 'discovery' transformed Latin America of nowadays in the region that has the biggest Catholic population in the world. The previous studies in Korea regarding Latin American Catholicism has focused on the spread of Catholicism in relation to the European colonization, rather than analyzing the concrete and detailed ways in which Catholicism exerted tremendous influences in the whole continent. They were less attentive to various historical contexts in which the diffusion of Catholicism differed greatly according to cultural landscapes and political specificities. Thus, this essay attempts to examine the diffusion of Catholicism from the perspective of confrontation between royal authorities and the power of church. The essay points out that the royal communities and institutional authorities which facilitated the intial process of Catholic evangelization maintained antagonistic relationship with ecclesial powers. By delving into the gradual transformation of church systems, it reveals that Catholicism in Latin America became a major field for conquerors in power to attain economic and political dominance. And unlike the initial submission and hospitality, the religious convert of the indigenous people attested to the violent inhumanity and opposition. Therefore, the essay aims to pave a clearer way to the understanding of complicated dynamics and conflicts between Catholicism in Latin America and the establishment of Spanish colonization.

• The Journal of the Korea Contents Association
• /
• v.18 no.11
• /
• pp.135-145
• /
• 2018

In online communities, users use comments to exchange their opinions and feelings on various subjects. Communication based on comments is quick and convenient, but sometimes this light-weight characteristic makes users use impolite and aggressive words, which leads to an online conflict. Therefore, it is important to analyze and classify users according to their characteristics in order to predict and take action for this kind of troubles. In this paper, we present several quantitative measures for describing the structures of comments trees based on the assumption that the user characteristics be observed as a form of some structural feature in comment trees of articles in which they posted comments. We examine the distribution of the proposed measures over article posters and commenters, and in addition, we show the effectiveness of the presented structural features by conducting experiments to classify users who have received warnings of the administrator from benign users.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.2
• /
• pp.156-164
• /
• 2019

In this paper, we propose an efficient dynamic slot re-assignment scheme for swarming drone networks in which networks members merged and split frequently. The leader drone of each network recognizes the slot allocation information of neighbor networks by periodic information exchange among between the drones. Using the information, the leader drone makes a decision how to reallocate the slots between members in case of network merge. The non-competitive method in the proposed scheme can re-assign the slots without any slot collision and shows always superior performance than competitive scheme. The competitive method in the proposed scheme reduces the number of slots that should be re-assigned in case of network merge. The experimental performance analysis shows that the proposed scheme performs better or at least equal to the performance of the competitive scheme in a swarming drone network.

• Journal of the Korean Society of Systems Engineering
• /
• v.14 no.2
• /
• pp.24-32
• /
• 2018

System Complexity one of the most common cause failure of the projects, it leads to a lack of understanding about the functions of the system. Hence, the model is developed for communication and furthermore modeling help analysis, design, and understanding of the system. On the other hand, the text-based specification is useful and easy to develop but is difficult to visualize the physical composition, structure, and behaviour or data exchange of the system. Therefore, it is necessary to transform system description into a diagram which clearly depicts the behaviour of the system as well as the interaction between components. According to the International Atomic Energy Agency (IAEA) Safety Glossary, The safety system is a system important to safety, provided to ensure the safe shutdown of the reactor or the residual heat removal from the reactor core, or to limit the consequences of anticipated operational occurrences and design basis accidents. Core Protection Calculator System (CPCS) in Advanced Power Reactor 1400 (APR 1400) Nuclear Power Plant is a safety critical system. CPCS was developed using systems engineering method focusing on Departure from Nuclear Boiling Ratio (DNBR) calculation. Due to the complexity of the system, many diagrams are needed to minimize the risk of ambiguities and lack of understanding. Using Model-Based Systems Engineering (MBSE) software for modeling the DNBR algorithm were used. These diagrams then serve as the baseline of the reverse engineering process and speeding up the development process. In addition, the use of MBSE ensures that any additional information obtained from auxiliary sources can then be input into the system model, ensuring data consistency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.79-89
• /
• 2004

Mobile IP Low Latency Handoffs allow greater support for real-time services on a Mobile W network by minimizing the period of time when a mobile node is unable to send or receive IP packets due to the delay in the Mobile IP Registration process. However, on Mobile IP network with AAA servers that are capable of performing Authentication, Authorization, and Accounting(AAA) services, every Registration has to be traversed to the home network to achieve new session keys, that are distributed by home AAA server, for a new Mobile IP session. This communication delay is the time taken to re-authenticate the mobile node and to traverse between foreign and home network even if the mobile node has been previously authorized to old foreign agent. In order to reduce these extra time overheads, we present a method that performs Low Latency Handoffs without requiring funker involvement by home AAA server. The method re-uses the previously assigned session keys. To provide confidentiality and integrity of session keys in the phase of key exchange between agents, it uses a key sharing method by gateway foreign agent that Performs a ousted thirty party. The Proposed method allows the mobile node to perform Low Latency Handoffs with fast as well as secure operation

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.83-92
• /
• 2007

In connectionless packet network, if a sender encrypts packets by block chaining mode and send it to receiver, the receiver should decrypt packets in encrypted order that is not received order. Therefore, the performance and efficiency are lowered for crypto communication system. To solve this problem, we propose packet encryption scheme for connectionless packet network that can decrypt the packets independently, even if the received order of packets are changed or packets are missed. The scheme makes new IV(Initial Vector) using IV that created by key exchange process and salt that made by random number. We propose extended Cryptoki API that added packet encryption/decryption functions and mechanism for improving convenience and performance. We implement the scheme and get result that the performance increased about $1.5{\sim}l5.6$ times compare with in case of implementing using Cryptoki API in the test environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.473-483
• /
• 2012

To achieve an entire end-to-end security, the classical authentication setting such that all participants have a same password is not practical since a password is not a common secret but a personal secret depending on an individual. Thus, an efficient client to client different password-based authenticated key agreement protocol (for short, EC2C-PAKA) has been suggested in the cross-realm setting. Very recently, however, a security weakness of the EC2C-PAKA protocol has been analyzed by Feng and Xu. They have claimed that the EC2C-PAKA protocol is insecure against a password impersonation attack. They also have presented an improved version of the EC2C-PAKA protocol. In this paper, we demonstrate that their claim on the insecurity of EC2C-PAKA protocol against a password impersonation attack is not valid. We show that the EC2C-PAKA protocol is still secure against the password impersonation attack. In addition, ironically, we show that the improved protocol by Feng and Xu is insecure against an impersonation attack such that a server holding password of Alice in realm A can impersonate Bob in realm B. We also discuss a countermeasure to prevent the attack.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.6
• /
• pp.37-47
• /
• 2009

In VANET, each vehicle can obtain traffic information from other vehicles or infrastructure, and they frequently exchange life-critical safety message. Therefore, it is necessary among vehicles to establish a secure channel for keeping the driver's safe and protecting the channel against several attack challenges. TSVC is a representative scheme which needs low communication and computation to be performed. But, there is a delay when verifying the messages because it is designed based on TESLA. Thus, it is not acceptable to use TSVC for sending the time-critical messages. In this paper, we propose a novel message authentication scheme which reduces a delay for the verification of messages. Therefore, the proposed scheme can be suitable to transmitting time-critical messages. Furthermore, the scheme supports to privacy preservation and can robust against DoS attacks.

• Analytical Science and Technology
• /
• v.34 no.3
• /
• pp.99-114
• /
• 2021

Substance identification is the first step in implementing chemical legislation, such that subsequent hazard and risk assessments can be accurately followed. Based on the web page and related guidance documents of the European Chemicals Agency and available consortia information, the procedure for substance identification carried out in Registration, Evaluation, Authorization and Restriction of Chemicals (REACH) is surveyed. In this study, the importance of substance identification and substance sameness check, as well as the necessity of generating a substance identity profile (SIP) are considered. In addition, the SIPs of several substance types are presented, which focused on information utilization in the instrumental analysis results and organization of information to generate the SIP. Analytical science can contribute to the accurate and effective implementation of chemical regulation at the starting stage of substance identification. However, understanding of the regulation and consequent final wrap-up of analytical results as a SIP should be followed for communication among registrants in Substance Information Exchange Forum (SIEF) as well as with related authorities.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1609-1617
• /
• 2019

Described in this paper is a design of hardware accelerator for implementing public-key cryptographic protocols (PKCPs) based on Elliptic Curve Cryptography (ECC) and RSA. It supports five elliptic curves (ECs) over GF(p) and three key lengths of RSA that are defined by NIST standard. It was designed to support four point operations over ECs and six modular arithmetic operations, making it suitable for hardware implementation of ECC- and RSA-based PKCPs. In order to achieve small-area implementation, a finite field arithmetic circuit was designed with 32-bit data-path, and it adopted word-based Montgomery multiplication algorithm, the Jacobian coordinate system for EC point operations, and the Fermat's little theorem for modular multiplicative inverse. The hardware operation was verified with FPGA device by implementing EC-DH key exchange protocol and RSA operations. It occupied 20,800 gate equivalents and 28 kbits of RAM at 50 MHz clock frequency with 180-nm CMOS cell library, and 1,503 slices and 2 BRAMs in Virtex-5 FPGA device.