• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2427-2445
• /
• 2016

In contrast to traditional "store-and-forward" routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.

• 전기학회논문지
• /
• 제60권1호
• /
• pp.205-213
• /
• 2011

The Long Term Evolution (LTE) system is designed to provide a high quality data service for fast moving mobile users. It is based on the Orthogonal Frequency Division Multiplexing (OFDM) and relies its channel estimation on the training samples which are systematically built within the transmitting data. Either a preamble or a lattice type is used for the distribution of training samples and the latter suits better for the multipath fading channel environment whose channel frequency response (CFR) fluctuates rapidly with time. In the lattice-type structure, the estimation of the CFR makes use of the least squares estimate (LSE) for each pilot samples, followed by an interpolation both in time-and in frequency-domain to fill up the channel estimates for subcarriers corresponding to data samples. All interpolation schemes should rely on the pilot estimates only, and thus, their performances are bounded by the quality of pilot estimates. However, the additive noise give rise to high fluctuation on the pilot estimates, especially in a communication environment with low signal-to-noise ratio. These high fluctuations could be monitored in the alternating high values of the first forward differences (FFD) between pilot estimates. In this paper, we analyzed statistically those FFD values and propose a postprocessing algorithm to suppress high fluctuations in the noisy pilot estimates. The proposed method is based on a localized adaptive moving-average filtering. The performance of the proposed technique is verified on a multipath environment suggested on a 3GPP LTE specification. It is shown that the mean-squared error (MSE) between the actual CFR and pilot estimates could be reduced up to 68% from the noisy pilot estimates.

• 정보보호학회논문지
• /
• 제27권4호
• /
• pp.951-959
• /
• 2017

현재 가장 많이 사용되고 있는 공개키 암호 알고리즘인 RSA에 대하여, 만약 암 복호문 이외의 부가 정보가 주어진 경우 이를 이용해 RSA 시스템의 안전성을 분석하는 것은 부채널 공격, 격자 기반 공격 등에서 많이 다루어지고 있다. 최근에는 전원이 차단된 DRAM의 데이터 유지 성질을 이용한 Cold Boot Attack에서도 이러한 부가 정보를 이용한 RSA 개인키 복구 방법이 많이 연구되고 있다. 본 논문에서는 전체 비트 중 일부 비트는 삭제가 되고 동시에 일부 비트에는 오류가 있는 RSA 개인키가 주어진 경우 원래의 개인키를 복구하는 문제를 다루며, 구체적으로는 이전에 제안된 Kunihiro 등의 알고리즘과 비교하여 그 성능이 향상된 새로운 RSA 개인키 복구 알고리즘을 제안한다.

• 대한수학회지
• /
• 제52권4호
• /
• pp.853-868
• /
• 2015

Let G be a complex semisimple simply connected linear algebraic group. The main result of this note is to give several equivalent criteria for the untwistedness of the twisted cubes introduced by Grossberg and Karshon. In certain cases arising from representation theory, Grossberg and Karshon obtained a Demazure-type character formula for irreducible G-representations as a sum over lattice points (counted with sign according to a density function) of these twisted cubes. A twisted cube is untwisted when it is a "true" (i.e., closed, convex) polytope; in this case, Grossberg and Karshon's character formula becomes a purely positive formula with no multiplicities, i.e., each lattice point appears precisely once in the formula, with coefficient +1. One of our equivalent conditions for untwistedness is that a certain divisor on the special fiber of a toric degeneration of a Bott-Samelson variety, as constructed by Pasquier, is basepoint-free. We also show that the strict positivity of some of the defining constants for the twisted cube, together with convexity (of its support), is enough to guarantee untwistedness. Finally, in the special case when the twisted cube arises from the representation-theoretic data of $\lambda$ an integral weight and $\underline{w}$ a choice of word decomposition of a Weyl group element, we give two simple necessary conditions for untwistedness which is stated in terms of $\lambda$ and $\underline{w}$.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2002년도 하계학술대회 논문집
• /
• pp.13-17
• /
• 2002

Ga$_2$O$_3$ nanomaterials were synthesized from mechanically ground GaN powders with thermal annealing Ga$_2$O$_3$ nanobelts were farmed in a nitrogen atmosphere, while Ga$_2$O$_3$ nanoparticles were formed inan oxygen atmosphere. The structural properties of the Ga$_2$O$_3$ nanomaterials were investigated by X-ray diffractometer (XRD) and high-resolution transmission eleotron microscope (HRTEM). The study of field emission scanning electron microscopy (FESEM) on the microstructures of nanomaterials revealed that the nanobelts are with the range of about 10∼200nm width and 10∼50nm thickness, and that nanoparticles are with the range of about 20∼50nm radius. On the basis of XRD and HRTEM data, we determined that the nanobelts grow toward a direction perpendicular to the (010) lattice plane and that they are enclosed by facets of the (10T) and (101) lattice planes. The formation of the nanobelts may be described by the vapor-solid(VS) mechanism, and the supersaturation device of gaseous phase may play an important role in the formation of Ga$_2$O$_3$ nanomaterials.

• 대한화학회지
• /
• 제58권6호
• /
• pp.528-534
• /
• 2014

어떤 이성분계용액에서는 상한임계용액온도와 하한임계용액온도가 동시에 나타나는 원형모양의 온도-조성 상도를 보인다. 이러한 현상은 분자간 특정상호작용이 존재하는 경우 나타나는 것으로 알려져 있다. 특정상호작용을 묘사하는 방법에는 여러 가지가 있다. 본 연구에서는 특정상호작용의 총수가 이항분포에 따라 분포한다고 가정하였다. 이 경우 특정상호작용을 Regular 용액이론, Quasichemical 이론 그리고 Flory-Huggins 격자이론에 적용하였을 때 원형모양의 온도-조성 상도를 보이는 경우에 대한 정확한 수학적인 조건을 유도하였다. 그리고 매개변수들이 온도-조성상도에 미치는 영향을 조사하였고, 물-니코틴에 대한 온도-조성상도를 계산하여 실험값과 비교하여 보았다.

• Smart Structures and Systems
• /
• 제18권5호
• /
• pp.865-884
• /
• 2016

We have previously demonstrated a microfluidic elastomer, which changes apparent color and could have potential applications in smart windows. The practical use of such functional microfluidic systems requires rapid and uniform fluid displacement throughout the channel network with minimal amount of liquid supply. The goal of this simulation study is to design various microfluidic networks for similar applications including, but not limited to, the color-switching windows and compare the liquid displacement speed and efficiency of the designs. We numerically simulate and analyze the liquid displacement in the microfluidic networks with serpentine, parallel and lattice channel configurations, as well as their modified versions with wide or tapered distributor and collector channels. The data are analyzed on the basis of numerical criteria defined to evaluate the performance of the corresponding functional systems. We found that the lattice channel network geometry with the tapered distributors and collectors provides most rapid and uniform fluid displacement with minimum liquid waste. The simulation results could give an important guideline for efficient liquid supply/displacement in emerging functional systems with embedded microfluidic networks.

• 한국전산유체공학회지
• /
• 제22권1호
• /
• pp.103-109
• /
• 2017

The aerodynamic noise reduction of railway traction motor is required to satisfy new enhanced Korean noise regulations for a train. This paper is the study result on a noise reduction of a railway traction motor using Lattice Boltzmann Method(LBM). To verify the reliability of numerical analysis, the noise performance of the base model evaluated using LBM, and calculated result was compared with the experimental data. In addition, main noise sources were selected to design parameters through analyzing the flow field of the base model. Based on the noise sources analysis result, a design improvement model of traction motor for this study was derived to reduce the noise. The performance of a design improvement model was evaluated by applying a validated numerical scheme. As a result, it was confirmed that the noise was reduced due to the suppression of the internal turbulent flow components.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2006년도 춘계학술대회 논문집
• /
• pp.239-240
• /
• 2006

For longer than picosecond pulses, bulk damage inside defect-free dielectrics involves the heating and multiplication of spurious electrons by the incident laser beam and transfer of this energy to the lattice. The situation is quite different for femtosecond pulses which are shorter than the time scale for electron energy transfer to the lattice. Damage caused by these pulses is produced with smaller statistical uncertainty and is controllable on a microscopic scale. These properties can be exploited to produce laser devices such as arrays of damage dots for all optical memories with high data storage density or arrays of parallel grooves to form transmission gratings. In this work, we observed characteristic of the femtosecond laser machining in BK7 and fused silica.

• 한국컴퓨터정보학회논문지
• /
• 제1권1호
• /
• pp.53-64
• /
• 1996

이동 통신 시스템에서 DSP 기능을 수행하는 적응필터를 설계하기 위한 방법으로는 최소-제곱조정(Least-squares adjustment) 알고리즘. Fast-Kalman 알고리즘 그리고 적응 격자(adaptive lattice) 알고리즘이 있다. 최소-제곱 조정 알고리즘은 적응 등화의 신호처리를 위해 고속 수렴하고이동 통신 시스템의 다중 경로 페이딩 채널에서 발생되는 심볼간 간섭을 제거하는데 사용된다. 본 논문에서는 기존의 최소-제곱 조정 알고리즘의 계수를 몇 가지 새로운 데이타 순서에 대한 샘플링 된 신호 벡터의 대수학적인 특성을 적절히 조정하여 구하는 방법을 제시하였고 컴퓨터 시물레이션 결과 기존 알고리즘들보다 고속 수렴하고 반복 수행 속도가 개선됨을 확인하였다.