• Korean Journal of Community Nutrition
• /
• v.18 no.2
• /
• pp.154-164
• /
• 2013

The objectives of this study were to assign reasonability to importance of weight selection issue in key performance indicator for performance evaluation of Centers for Child-care Foodservice Management (CCFSM) developed by using Balanced Scorecard (BSC), to draw key performance indicator (KPI) by perspective and to analyze differences in recognition on importance. From September 25 to October 9, 2012, we conducted a questionnaire-based study via e-mail, targeting chiefs and team leaders of nationwide 21 CCFSMs (43 persons), officials of local governments where CCFSM was established (21 persons), officials of Korea Food and Drug Administration (2 persons) and foodservice management experts (27 persons) in order to estimate the relative importance on 4 perspectives and 14 KPIs and analyzed its results by using 61 collected data. The results showed that relative importance of perspectives was estimated in order of importance as follows: business performance (0.3519), customer (0.3393), resource (0.1557), learning and growth (0.1531). Relative importance of KPIs was in order of importance as follows: Evaluation of sanitary management level in child-care foodservice facilities (0.1327), Level of customer recognition and behavior improvement (0.1153), performances of round visiting inspection on foodservice, sanitary, safety management, and foodservice consulting (0.0913). Our results showed that the recognition differences exist on the relative importance of perspectives and KPIs between officials of CCFSM, KFDA, local government and foodservice management experts. These observations will form the basis for developing evaluation systems, and it is considered that performance indicators developed on this basis will suggest direction of operation which CCFSM will have to perform.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.25-34
• /
• 2009

Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir [1] proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al. [12] proposed two-round ID-based AGKA protocol which is very efficient in communication and computation complexity. However, their protocol does not provide user identification and suffers from the impersonation attack by malicious participants. In this paper, we propose improved ID-based AGKA protocol to prevent impersonation attack from Zhou et al.'s protocol. In our protocol, the malicious insider cannot impersonate another participants even if he knows the ephemeral group secret value. Moreover, our protocol reduces the computation cost from Zhou et al.'s protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.6
• /
• pp.3-13
• /
• 2010

Differential Fault Analysis (DFA) is widely known for one of the most efficient method analyzing block cipher. In this paper, we propose a new type of DFA on DES (Data Encryption Standard). DFA on DES was first introduced by Biham and Shamir, then Rivain recently introduced DFA on DES middle rounds (9-12 round). However previous attacks on DES can only be applied to the encryption process. Meanwhile, we first propose the DFA on DES key-schedule. In this paper, we proposed a more efficient DFA on DES key schedule with random fault. The proposed DFA method retrieves the key using a more practical fault model and requires fewer faults than the previous DFA on DES.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.91-94
• /
• 2012

This paper describes an efficient implementation of ARIA crypto algorithm which is a KS (Korea Standards) block cipher algorithm. The ARIA crypto-processor supports three master key lengths of 128/192/256-bit specified in the standard. To reduce hardware complexity, a hardware sharing is employed, which shares round function in encryption/decryption module with key initialization module. It reduces about 20% of gate counts when compared with straightforward implementation. The ARIA crypto-processor is verified by FPGA implementation, and synthesized with a 0.13-${\mu}m$ CMOS cell library. It has 33,218 gates and the estimated throughput is about 640 Mbps at 100 MHz.

• BMB Reports
• /
• v.50 no.2
• /
• pp.55-57
• /
• 2017

Toll-like receptor 4 (TLR4) together with MD2, one of the key pattern recognition receptors for a pathogen-associated molecular pattern, activates innate immunity by recognizing lipopolysaccharide (LPS) of Gram-negative bacteria. Although LBP and CD14 catalyze LPS transfer to the TLR4/MD2 complex, the detail mechanisms underlying this dynamic LPS transfer remain elusive. Using negative-stain electron microscopy, we visualized the dynamic intermediate complexes during LPS transfer-LBP/LPS micelles and ternary CD14/LBP/LPS micelle complexes. We also reconstituted the entire cascade of LPS transfer to TLR4/MD2 in a total internal reflection fluorescence (TIRF) microscope for a single molecule fluorescence analysis. These analyses reveal longitudinal LBP binding to the surface of LPS micelles and multi-round binding/unbinding of CD14 to single LBP/LPS micelles via key charged residues on LBP and CD14. Finally, we reveal that a single LPS molecule bound to CD14 is transferred to TLR4/MD2 in a TLR4-dependent manner. These discoveries, which clarify the molecular mechanism of dynamic LPS transfer to TLR4/MD2 via LBP and CD14, provide novel insights into the initiation of innate immune responses.

• Structural Engineering and Mechanics
• /
• v.68 no.4
• /
• pp.497-505
• /
• 2018

Three points bending flexural test was modeled numerically to study the crack propagation in the pre-cracked beams. The pre-existing edge cracks in the beam models were considered to investigate the crack propagation and coalescence paths within the modeled samples. The effects of particle size on the single edge-notched round bar in bending test were considered too. The results show that Failure pattern is constant by increasing the ball diameter. Tensile cracks are dominant mode of failure. These crack initiates from notch tip, propagate parallel to loading axis and coalescence with upper model boundary. Number of cracks increase by decreasing the ball diameter. Also, tensile fracture toughness was decreased with increasing the particle size. In the present study, the influences of particles sizes on the cracks propagations and coalescences in the brittle materials such as rocks and concretes are numerically analyzed by using a three dimensional particle flow code (PFC3D). These analyses improve the understanding of the stability of rocks and concretes structures such as rock slopes, tunnel constructions and underground openings.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.237-240
• /
• 2012

This paper describes an implementation of ARIA crypto algorithm which is a KS (Korea Standards) block cipher algorithm. The ARIA crypto-core supports three master key lengths of 128/192/256-bit specified in the standard and the four modes of operation including ECB, CBC, CTR and OFB. To reduce hardware complexity, a hardware sharing is employed, which shares round function in encryption/decryption module with key initialization module. The ARIA crypto-core is verified by FPGA implementation, the estimated throughput is about 1.07 Gbps at 167 MHz.

• Smart Media Journal
• /
• v.4 no.4
• /
• pp.39-46
• /
• 2015

This paper describes hardware implementation of the encryption block of the '128 bit block cipher LEA' among various lightweight encryption algorithms for IoT (Internet of Things) security. Round function blocks and key-schedule blocks are designed by parallel circuits for high throughput. The encryption blocks support secret-key of 128 bits, and are designed by FSM method and 24/n stage(n=1, 2, 3, 4, 8, 12) pipeline methods. The LEA-128 encryption blocks are modeled using Verilog-HDL and implemented on FPGA, and according to the synthesis results, minimum area and maximum throughput are provided.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.1 s.149
• /
• pp.31-37
• /
• 2006

The purpose of this study was to value the present condition of natlwal dyeing, to forecast needs in natural dyeing world and to off the preliminary data on future direction of research and enhancement plan. The three-round Delphi tests were performed with 36 professional in the academic, the industrial, and the art world. The result of the study is as follows: Factor analysis showed the troubles were classified into 4 categories; 'dyeing', 'basis', 'industry' and 'consumer and environment'. Supplementary measures and future direction research 3categories; 'development', 'education' and 'mass production' And commercialization. popularization 2 categories; 'commercialization' and 'popularization'. 'Dyeing' is correlated with 'mass production', 'basis' with 'education' and 'education' with 'commercialization' and 'popularization'. The engaged period in natural dyeing world is longer, professionals were more concerned about 'consumer and environment' The most influential element of the present question in the view is 'education'.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1944-1956
• /
• 2016

The Digital Video Broadcasting-Common Scrambling Algorithm is an ETSI-designated algorithm designed for protecting MPEG-2 signal streams, and it is universally used. Its structure is a typical hybrid symmetric cipher which contains stream part and block part within a symmetric cipher, although the entropy is 64 bits, there haven't any effective cryptanalytic results up to now. This paper studies the security level of CSA against impossible differential cryptanalysis, a 20-round impossible differential for the block cipher part is proposed and a flaw in the cipher structure is revealed. When we attack the block cipher part alone, to recover 16 bits of the initial key, the data complexity of the attack is O(2^44.5), computational complexity is O(2^22.7) and memory complexity is O(2^10.5) when we attack CSA-BC reduced to 21 rounds. According to the structure flaw, an attack on CSA with block cipher part reduced to 21 rounds is proposed, the computational complexity is O(2^21.7), data complexity is O(2^43.5) and memory complexity is O(2^10.5), we can recover 8 bits of the key accordingly. Taking both the block cipher part and stream cipher part of CSA into consideration, it is currently the best result on CSA which is accessible as far as we know.