• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.01a
• /
• pp.207-208
• /
• 2017

악성코드는 매년 그 수가 증가하고 있으며, 악성코드의 공격기법이 지능적이고 복합적으로 진화함에 따라 이에 대한 분석과 대응이 요구된다. 하지만 일부 악성코드는 감염여부를 숨기기 위하여 분석에 대한 회피방법으로 루트킷을 통하여 방어자에 의한 악성코드의 코드 분석을 우회함으로써 은폐된 상태로 악의적인 공격을 수행한다. 따라서 본 논문에서는 유저레벨에서 IAT(Import Address Table)의 정보를 후킹하여 악성 행위를 수행하는 루트킷을 탐지하는 대응방안을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1192-1213
• /
• 2011

Information security management systems (ISMSs) are used to manage information about their customers and themselves by governments or business organizations following advances in e-commerce, open networks, mobile networks, and Internet banking. This paper explains the existing ISMSs and presents a comparative analysis. The discussion deals with different types of ISMSs. We addressed issues within the existing ISMSs via analysis. Based on these analyses, then we proposes the development of an information security management evaluation system (ISMES). The method can be applied by a self-evaluation of the organization and an evaluation of the organization by the evaluation committee. The contribution of this study enables an organization to refer to and improve its information security levels. The case study can also provide a business organization with an easy method to build ISMS and the reduce cost of information security evaluation.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.787-793
• /
• 2012

Piccolo-128 is a 64-bit ultra-light block cipher suitable for the constrained environments such as wireless sensor network environments. In this paper, we propose biclique cryptanalysis on the full Piccolo-128. To recover the secret key of Piccolo-128, the proposed attack requires $2^{24}$ chosen plaintexts and the computational complexity of about $2^{127.35}$. This result is the first known theoretical attack result on the full Piccolo-128.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.40-50
• /
• 2008

The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3316-3332
• /
• 2019

In a transitive signature scheme, a signer wants to authenticate edges in a dynamically growing and transitively closed graph. Using transitive signature schemes it is possible to authenticate an edge (i, k), if the signer has already authenticated two edges (i, j) and (j, k). That is, it is possible to make a signature on (i, k) using two signatures on (i, j) and (j, k). We propose the first transitive signature schemes for undirected graphs from lattices. Our first scheme is provably secure in the random oracle model and our second scheme is provably secure in the standard model.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.9 s.339
• /
• pp.51-60
• /
• 2005

The design of efficient cryptosystems is mainly appointed by the efficiency of the underlying finite field arithmetic. Especially, among the basic arithmetic over finite field, the rnultiplicative inversion is the most time consuming operation. In this paper, a fast inversion algerian in finite field $GF(2^m)$ with the standard basis representation is proposed. It is based on the Extended binary gcd algorithm (EBGA). The proposed algorithm executes about $18.8\%\;or\;45.9\%$ less iterations than EBGA or Montgomery inverse algorithm (MIA), respectively. In practical applications where the dimension of the field is large or may vary, systolic array sDucture becomes area-complexity and time-complexity costly or even impractical in previous algorithms. It is not suitable for low-weight and low-power systems, i.e., smartcard, the mobile phone. In this paper, we propose a new hardware architecture to apply an area-efficient and a synchronized inverter on low-complexity systems. It requires the number of addition and reduction operation less than previous architectures for computing the inverses in $GF(2^m)$ furthermore, the proposed inversion is applied over either prime or binary extension fields, more specially $GF(2^m)$ and GF(P) .

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.22 no.1
• /
• pp.32-50
• /
• 2008

This study is concerned with examining the causes and symptoms of Woman various diseases and clearing up the situations of pulses and their treatment. Woman various diseases are said to be various kinds of diseases including the disorder of menstruation and genitals except pregnancy and postpartum diseases. The main contents are the penetration of heat into worm, the discharge of much blood, stomachache, and the postpartum cyst diseases. Among them, the nature of the diseases which often occur in the gynecology, such as the menstrual diseases and stomachache, were described comparatively in detail. The reason why heat penetrates into the worm is that the external germs come into it under its weakness. To treat it, heat should be removed and lumping blood should be sent out of body. Especially only after whether the disease is serious or not is examined, and just after the process of the disease is examined, the lumping blood can be eliminated. The ways to cure it by sweating a patient too much, getting him or her to vomit, or forcing him or her to be urinated too much, should be avoided. The disorder of menstruation, as the disease which most often occur among the diseases of gynecology, includes menstrual irregularity and blood discharge, and non-menstruation. Among them, non-menstruation and blood discharge are comparatively often discussed. When they are treated, lumping blood and cold energy should be cured well through getting rid of the lumping blood and making the blood vessel flow well. The difficult urination after childbirth, which comes from the weak urinary cist, makes symptoms such as the stuffy chest, the difficulty of lying down, and breathing with his or her back something. To urinate better, the ability of the urinary cist should be supplemented and improved. The principle of the treatment for Woman various diseases is to examine the situation of the pulse closely, then set up the way to treat it, and prescribe a patient. In this study, besides the treatment of Chinese herb medicine, the medicine for washing genitals and the medicine placed in the worm were used to cure Woman various diseases. This treatment is the beginning of the surgical treatment in the gynecology.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2692-2707
• /
• 2012

A separable identity-based ring signature scheme has been constructed as a fundamental cryptographic primitive for protecting user privacy. Using the separability property, ring members can be selected from arbitrary domains, thereby, giving a signer a wide range of ways to control privacy. In this paper we propose a generic method to construct efficient identity-based ring signature schemes with various levels of separability. We first describe a method to efficiently construct an identity-based ring signature scheme for a single domain, in which a signer can select ring identities by choosing from identities defined only for the domain. Next, we present a generic method for linking ring signatures constructed for a single domain. Using this method, an identity-based ring signature scheme with a compact structure, supporting multiple arbitrary domains can be designed. We show that our method outperforms the best known schemes in terms of signature size and computational costs, and that the security model based on the separability of identity-based ring signatures, presented in this paper, is highly refined and effective by demonstrating the security of all of the proposed schemes, using a model with random oracles.

• Journal of Broadcast Engineering
• /
• v.12 no.4
• /
• pp.350-359
• /
• 2007

In this paper we present a simple, efficient method for detection of sharp digital images. Recently many digital cameras are equipped with various autofocusing functions to help users take well-focused pictures as easily as possible. However, acquired digital pictures can be further degraded by motion, limited contrast, and inappropriate amount of exposure, to name a few. In order to decide whether to process the image or not, or whether to delete it or not, reliable measure of image quality to detect sharp images from blurry ones is needed. This paper presents a blurriness/sharpness measure, and demonstrates its feasibility using extensive experiments. This method is fast and easy to implement, and accurate. Regardless of the detection accuracy, existing measures are computation-intensive. However, the proposed measure in this paper is not demanding in computation time. Needless to say, this measure can be used for various imaging applications including autofocusing and astigmatism correction.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.757-766
• /
• 2006

Mobile Ad-hoc Network(MANET) is an autonomous network consisted of mobile hosts. A considerable number of studies have been conducted on the MANET with studies of ubiquitous computing. Several studies have been made on the clustering schemes which manage network hierarchically to Improve flat architecture of MANET. But the conventional schemes have the lack of multi-hop clustering and load balancing. This paper proposes a clustering scheme to support multi-hop clustering and to consider load balancing between cluster heads. We define the split of clusters and states of cluster, and propose join, merge, divide, and election of cluster head schemes for load balancing of between cluster heads