• Korean Journal of Labor Studies
• /
• v.19 no.1
• /
• pp.1-34
• /
• 2013

Labor share of income in Korea has fallen from 90% in 1996 to 79% in 2010. This paper explores the factors driving the movements in the labor share of income based on a panel dataset containing 19 years of data on 18 Korean manufacturing industries. The effects of technical progress, globalization and the bargaining power of labor and capital on the labor share of income are tested for the period of 1991-2009. The main empirical results are as follows. (1) Capital-aug menting technical prog ress measured by capital-labor ratio and R&D intensity has a negative effect on the labor share. (2) Market openness measured by the value of export and import as a ratio to value-added production is found to have a positive impact. (3) Globalization of production measured by inward-FDI and outward-FDI as a ratio to total domestic fixed capital is found to have a negative impact on the labor share. (4) Union density is found to have had a statistically significant effect in 1991-1998. This finding is consistent with the efficient bargain model in which firms and workers bargain over both wages and employment. But union density is insignificant in 2000-2009. This implies that since the financial crisis in 1997, the bargaining institution in Korea has been approaching the right-to-manage model in which firms and unions bargain over wages and then firms set employment unilaterally. (5) Variables for domestic financialization measured by dividend-income ratio and financial-fixed assets ratio have an insignificant effect on labor share.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.2
• /
• pp.73-92
• /
• 1997

A modular exponentiation( E$M^{$=varepsilon$}$mod N) is one of the most important operations in Public-key cryptography. However, it takes much time because the modular exponentiation deals with very large operands as 512-bit integers. Modular exponentiation is composed of repetition of modular multiplications, and the number of repetition is the same as the length of the addition-chain of the exponent(E). Therefore, we can reduce the execution time of modular exponentiation by finding shorter addition-chain(i.e. reducing the number of repetitions) or by reducing the execution time of each modular multiplication. In this paper, we propose an addition-chain heuristics and two fast modular multiplication algorithms. Of two modular multiplication algorithms, one is for modular multiplication between different integers, and the other is for modular squaring. The proposed addition-chain heuristics finds the shortest addition-chain among exisiting algorithms. Two proposed modular multiplication algorithms require single-precision multiplications fewer than 1/2 times of those required for previous algorithms. Implementing on PC, proposed algorithms reduce execution times by 30-50% compared with the Montgomery algorithm, which is the best among previous algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.1
• /
• pp.13-23
• /
• 2001

This paper implemented into hardware SEED which is the KOREA standard 128-bit block cipher. First, at the respect of hardware implementation, we compared and analyzed SEED with AES finalist algorithms - MARS, RC6, RIJNDAEL, SERPENT, TWOFISH, which are secret key block encryption algorithms. The encryption of SEED is faster than MARS, RC6, TWOFISH, but is as five times slow as RIJNDAEL which is the fastest. We propose a SEED hardware architecture which improves the encryption speed. We divided one round into three parts, J1 function block, J2 function block J3 function block including key mixing block, because SEED repeatedly executes the same operation 16 times, then we pipelined one round into three parts, J1 function block, J2 function block, J3 function block including key mixing block, because SEED repeatedly executes the same operation 16 times, then we pipelined it to make it more faster. G-function is implemented more easily by xoring four extended 4 byte SS-boxes. We tested it using ALTERA FPGA with Verilog HDL. If the design is synthesized with 0.5 um Samsung standard cell library, encryption of ECB and decryption of ECB, CBC, CFB, which can be pipelined would take 50 clock cycles to encrypt 384-bit plaintext, and hence we have 745.6 Mbps assuming 97.1 MHz clock frequency. Encryption of CBC, OFB, CFB and decryption of OFB, which cannot be pipelined have 258.9 Mbps under same condition.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.23-32
• /
• 2001

Since the LILI-128 cipher is a clock-controlled keystream generator, the speed of the keystream data is degraded in a clock-synchronized hardware logic design. Basically, the clock-controlled $LFSR_d$ in the LILI-128 cipher requires a system clock that is 1 ~4 times higher. Therefore, if the same clock is selected, the system throughput of the data rate will be lowered. Accordingly, this paper proposes a 4-bit parallel $LFSR_d$, where each register bit includes four variable data routines for feed feedback of shifting within the $LFSR_d$ . Furthermore, the timing of the propose design is simulated using a $Max^+$plus II from the ALTERA Co., the logic circuit is implemented for an FPGA device (EPF10K20RC240-3), and the throughput stability is analyzed up to a late of 50 Mbps with a 50MHz system clock. (That is higher than the 73 late at 45 Mbps, plus the maximum delay routine in the proposed design was below 20ns.) Finally, we translate/simulate our FPGA/VHDL design to the Lucent ASIC device( LV160C, 0.13 $\mu\textrm{m}$ CMOS & 1.5v technology), and it could achieve a throughput of about 500 Mbps with a 0.13$\mu\textrm{m}$ semiconductor for the maximum path delay below 1.8ns.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.1
• /
• pp.135-141
• /
• 2011

Recent advances in mobile devices and development of various mobile applications dealing with private information of users made user authentication in mobile devices a very important issue. This paper presents a new user authentication method based on touch screen interfaces. This method uses for authentication the PIN digits as well as the exact locations the user touches to input these digits. Our method is fully compatible with the regular PIN entry method which uses numeric keypads, and it provides better usability than the behavioral biometric schemes because its PIN registration process is much simpler. According to our experiments, our method guarantees EERs of 12.8%, 8.3%, and 9.3% for 4-digit PINs, 6-digit PINs, and 11-digit cell phone numbers, respectively, under the extremely conservative assumption that all users have the same PIN digits and cell phone numbers. Thus we can guarantee much higher performance in identification functionality by applying this result to a more practical situation where every user uses distinct PIN and sell phone number. Finally, our method is far more secure than the regular PIN entry method, which is verified by our experiments where attackers are required to recover a PIN after observing the PIN entry processes of the regular PIN and our method under the same level of security parameters.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.41 no.2
• /
• pp.178-187
• /
• 1996

This study was conducted to obtain the basic informations for producing high quality seeds of vegetable soybeans. Four vegetable soybean cultivars, 'Okharawase', 'Mikawashima', 'Hwaeomputkong', and 'Seokryangputkong' were planted at four locations, Chulwon(altitude, 192m) and Pyeongchang(altitude, 370m) in highland, and Suwon(altitude, 37m)and Daegu(altitude, 55m) in lowland of Korea with two planting dates, May 15 and June 15. Seed infection rates were attributed by in order of phomopsis seed decay caused by Phomopsis spp., seed mottling caused by soybean mosaic virus (SMV), purple seed stain caused by Cercospora kikuchii. Seed infectron rate was the lowest at Pyeongchang and lower on June 15 than on May 15 planting. Phomopsis seed decay by Phomopsis spp. was lower in highland of Korea, Pyeongchang and Chulwon, than in lowland of Korea, Suwon and Daegu. Seed infection rate was also lower on June 15 planting than on May 15, and in seeds harvested at maturity than at ten days after maturity. Germination rate of seeds harvested in highland, Pyeongchang and Chulwon, after six to seven month storage at 5$\pm$1$^{\circ}C$ was more than 90% and higher than that of the seeds in lowland, Suwon and Daegu. Germination rate was also higher on June 15 than on May 15 planting.

• Korean Journal of Environment and Ecology
• /
• v.37 no.1
• /
• pp.35-58
• /
• 2023

In this study, we conducted a flora survey at Mt.Bakdal (363m) and Mt. Myeongbong (245.3m) in Paju-si, Gyeonggi-do. A total of 405 taxa, including 2 forms, 32 varieties, 8 subspecies, 363 species, 261 genera, and 87 families, were surveyed in the two mountain areas. The ferns were identified as 12 taxa from 6 families, the gymnosperms as 6 taxa from 2 families, the dicotyledonous plants as 290 taxa from 70 families, and the monocotyledonous plants as 97 taxa from 9 families. The remarkable plants included 8 taxa of the Korean endemic plants, which were Populus tomentiglandulosa, Salix koriyanagi, Clematis brachyura, Viola seoulensis, Forsythia koreana, Paulownia coreana, Weigela subsessilis, and Hemerocallis hakuunensis, and 3 taxa of the rare and endangered plants as designated by the Korea Forest Service, including Tylophora floribunda as Vulnerable (VU) species, and Viola albida and Chionanthus retusus as Least Concern (LC) species. The invasive alien plants were 35 taxa, including Rumex crispus, Phytolacca americana, Cerastium glomeratum, Chenopodium album, Chenopodium ficifolium, Lepidium virginicum, Amorpha fruticosa, Robinia pseudoacacia, and Trifolium repens, accounting for 8.5 percent of the 405 taxa of the surveyed plants. We intend to further identify plants through the studies on unsurveyed areas in the western part of the DMZ, identify the native habitats of rare and specialty plants, and use them as basic data for managing ecosystem-disturbing plants.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.511-525
• /
• 2023

As awareness of personal data protection increases, various Full Disk Encryption (FDE)-based applications are being developed that real-time encryption or use virtual drive volumes to protect data on user's PC. FDE-based applications encrypt and protect the volume containing user's data. However, as disk encryption technology advances, some users are abusing FDE-based applications to encrypt evidence associated with criminal activities, which makes difficulties in digital forensic investigations. Thus, it is necessary to analyze the encryption process used in FDE-based applications and decrypt the encrypted data. In this paper, we analyze Cryptomator and Norton Ghost, which provide volume encryption and backup functions. We analyze the encrypted data structure and encryption process to classify the main data of each application and identify the encryption algorithm used for data decryption. The encryption algorithms of these applications are recently emergin gor customized encryption algorithms which are analyzed to decrypt data. User password is essential to generate a data encryption key used for decryption, and a password acquisition method is suggested using the function of each application. This supplemented the limitations of password investigation, and identifies user data by decrypting encrypted data based on the acquired password.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.6
• /
• pp.167-174
• /
• 2022

PIPO lightweight block ciphers were announced in ICISC'20. In this paper, a single-block optimization implementation and parallel optimization implementation of PIPO lightweight block cipher ECB, CBC, and CTR operation modes are performed on a 32-bit RISC-V processor. A single block implementation proposes an efficient 8-bit unit of Rlayer function implementation on a 32-bit register. In a parallel implementation, internal alignment of registers for parallel implementation is performed, and a method for four different blocks to perform Rlayer function operations on one register is described. In addition, since it is difficult to apply the parallel implementation technique to the encryption process in the parallel implementation of the CBC operation mode, it is proposed to apply the parallel implementation technique in the decryption process. In parallel implementation of the CTR operation mode, an extended initialization vector is used to propose a register internal alignment omission technique. This paper shows that the parallel implementation technique is applicable to several block cipher operation modes. As a result, it is confirmed that the performance improvement is 1.7 times in a single-block implementation and 1.89 times in a parallel implementation compared to the performance of the existing research implementation that includes the key schedule process in the ECB operation mode.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.34-40
• /
• 2024

Secret sharing is a cryptographic technique that involves dividing a secret or a piece of sensitive information into multiple shares or parts, which can significantly increase the confidentiality of a secret. There has been a lot of research on secret sharing for different contexts or situations. Tassa's conjunctive secret sharing method employs polynomial derivatives to facilitate hierarchical secret sharing. However, the use of derivatives introduces several limitations in hierarchical secret sharing. Firstly, only a single group of participants can be created at each level due to the shares being generated from a sole derivative. Secondly, the method can only reconstruct a secret through conjunction, thereby restricting the specification of arbitrary secret reconstruction conditions. Thirdly, Birkhoff interpolation is required, adding complexity compared to the more accessible Lagrange interpolation used in polynomial-based secret sharing. This paper introduces the multi-compartment secret sharing method as a generalization of the conjunctive hierarchical secret sharing. Our proposed method first encrypts a secret using external groups' shares and then generates internal shares for each group by embedding the encrypted secret value in a polynomial. While the polynomial can be reconstructed with the internal shares, the polynomial just provides the encrypted secret, requiring external shares for decryption. This approach enables the creation of multiple participant groups at a single level. It supports the implementation of arbitrary secret reconstruction conditions, as well as conjunction. Furthermore, the use of polynomials allows the application of Lagrange interpolation.