• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.795-803
• /
• 2020

In this paper, we study known-key distinguishing and partial-collision attacks on GFN-2 structures with SP F-functions and various block lengths. Firstly, we show the known-key distinguishing attack is possible up to 15 rounds. Secondly, for the case that the last round function has the shuffle operation, we show that the partial-collision attack is possible up to 14 rounds. Finally, for the case that the last round function has no shuffle operation, we show that the partial-collision attacks are possible up to 11 rounds.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.77-83
• /
• 2016

A new key generation scheme is proposed to support partial encryption and partial decryption of data in cloud computing environment with a minimal key-related traffic overhead. Our proposed scheme employs a concept of hash tree chain to reduce the number of keys that need to be delivered to the decryption node. The performance of the proposed scheme is evaluated through simulation.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.09a
• /
• pp.745-746
• /
• 2005

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.280-295
• /
• 2015

Block cipher ARIA was first proposed by some South Korean experts in 2003, and later, it was established as a Korean Standard block cipher algorithm by Korean Agency for Technology and Standards. In this paper, we focus on the security evaluation of ARIA block cipher against the recent zero-correlation linear cryptanalysis. In addition, Partial-sum technique and FFT (Fast Fourier Transform) technique are used to speed up the cryptanalysis, respectively. We first introduce some 4-round linear approximations of ARIA with zero-correlation, and then present some key-recovery attacks on 6/7-round ARIA-128/256 with the Partial-sum technique and FFT technique. The key-recovery attack with Partial-sum technique on 6-round ARIA-128 needs $2^{123.6}$ known plaintexts (KPs), $2^{121}$ encryptions and $2^{90.3}$ bytes memory, and the attack with FFT technique requires $2^{124.1}$ KPs, $2^{121.5}$ encryptions and $2^{90.3}$ bytes memory. Moreover, applying Partial-sum technique, we can attack 7-round ARIA-256 with $2^{124.6}$ KPs, $2^{203.5}$ encryptions and $2^{152}$ bytes memory and 7-round ARIA-256 employing FFT technique, requires $2^{124.7}$ KPs, $2^{209.5}$ encryptions and $2^{152}$ bytes memory. Our results are the first zero-correlation linear cryptanalysis results on ARIA.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.135-136
• /
• 2002

Molybdenum Nitrided (MoNx) films were deposited by DC planar magnetron sputtering. Silicon wafers and real nitrided stainless steel piston rings are employed as substrates. 12 different combinations of nitrogen and argon partial pressure, from 1:7 to 7:1, were applied to deposit MoNx films. X-ray diffraction (XRD) was used to determine the phase structures of films. When nitrogen vs. argon partial pressure is 1:7, the film is mainly $Mo_2N$ phase. With increase of nitrogen partial pressure, MoN phase emerges, but $Mo_2N$ phase still exists. Composition analysis with atomic emission spectrometry (AES) also agreed with this. The films have very high nanohardness (max 2400Hv) and good adhesion to the substrates.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.448-452
• /
• 2004

Cache sensitive $B^+-trees$ with partial keys is cache sensitive tree using both key compression and pointer compression. Although conventional cache sensitive trees consider individuallykey compression and pointer compression, cache sensitive $B^+-trees$ with partial keys make more cache utilization by compressing both key and pointer. We implement bulkload and search algorithms of cache sensitive $B^+-trees$ with partial key. And out performance studies show that cache sensitive $B^+-trees$ with partial key is better than $B^+-trees$ and Simple Prefix $B^+-trees$.

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.578-580
• /
• 2008

• Journal of the Korean Vacuum Society
• /
• v.12 no.S1
• /
• pp.83-87
• /
• 2003

Zirconium oxide films have been synthesized by radio-frequency magnetron sputtering deposition on n-Si(001) substrate with metal zirconium target at variant $O_2$ partial pressures. The influences of $O_2$ partial pressures of the morphology, deposition rate, microstructure, and the dielectric constant of $ZrO_2$ have been discussed. The results show that deposition rate of $ZrO_2$ films decreases, the roughness, and the thickness of the native $SiO_2$ interlayer increases with the increase of $O_2$ partial pressure. $ZrO_2$ films synthesized at low $O_2$ partial pressure are amorphous and monoclinic polycrystalline in nanometer scale at low $O_2$ partial pressure. The relative dielectrics of $ZrO_2$ films are in the range of 12 to 25.

• Journal of Power Electronics
• /
• v.19 no.5
• /
• pp.1248-1258
• /
• 2019

This paper presents a moth-flame optimization (MFO)-based maximum power point tracking (MPPT) method for photovoltaic (PV) systems. The MFO algorithm is a new optimization method that exhibits satisfactory performance in terms of exploration, exploitation, local optima avoidance, and convergence. Therefore, the MFO algorithm is quite suitable for solving multiple peaks of PV systems under partial shading conditions (PSCs). The proposed MFO-MPPT is compared with four MPPT algorithms, namely the perturb and observe (P&O)-MPPT, incremental conductance (INC)-MPPT, particle swarm optimization (PSO)-MPPT and whale optimization algorithm (WOA)-MPPT. Simulation and experiment results demonstrate that the proposed algorithm can extract the global maximum power point (MPP) with greater tracking speed and accuracy under various conditions.

• Journal of information and communication convergence engineering
• /
• v.13 no.1
• /
• pp.27-35
• /
• 2015

Multiprecision multiplication is the most expensive operation in public key-based cryptography. Therefore, many multiplication methods have been studied intensively for several decades. In Workshop on Cryptographic Hardware and Embedded Systems 2011 (CHES2011), a novel multiplication method called 'operand caching' was proposed. This method reduces the number of required load instructions by caching the operands. However, it does not provide full operand caching when changing the row of partial products. To overcome this problem, a novel method, that is, 'consecutive operand caching' was proposed in Workshop on Information Security Applications 2012 (WISA2012). It divides a multiplication structure into partial products and reconstructs them to share common operands between previous and next partial products. However, there is still room for improvement; therefore, we propose a finely designed operand-caching mode to minimize useless memory accesses when the first row is changed. Finally, we reduce the number of memory access instructions and boost the speed of the overall multiprecision multiplication for public key cryptography.