• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1992.11a
• /
• pp.131-138
• /
• 1992

공용키 암호법의 대표적인 것으로 El Gamal 암호법과 RSA 암호법이 있는데, RAS 암호법은 정수의 인수분해가 어렵다는 것에 안전성을 둔 반면에 El Gamal 암호법은 discrete logarithm을 푸는 것이 어렵다는데 안전성을 두고 있다. (6) 그런데 유한체상의 멱승과 곱셈이 효율적으로 수행이 된다면 El Gamal 암호법이 유용하다는 사살을 알게 되었다. 그런데 Copperxmith의 이산로그 알고리즘을 이용하면 n〉1000이 되어야 El Gamal 암호법이 안전성을 보장 받을 수 있으나 이 경우 복잡도의 증가로 인한 gate수의 급속한 증가로 고속연산전용 VLSI 설계시 어려움이 있다. (3) 그래서 본 논문은 복잡도를 줄일 수 있는 정규기저들의 탐색에 연구의 중점을 두었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.701-703
• /
• 2000

본 논문에서는 정규 기저 표현(normal bases repersentation)을 갖는 GF(2n)상에서의 병렬 멱승 연산에 있어서 2 가지의 개선 사항을 기술한다. 첫째는,k를 윈도우 길이로 할 때 라운드가 [log k]+[log[n/k]]로 고정된 경우에 현재까지 알려진 방법보다 더 작은 수의 프로세서를 갖는 방안이다. 둘째는 점근적인(asymptotic)분석을 통하여 GF(2n)상에서의 병렬 멱승 연산이 O(n/log2n)개의 프로세서로 O(logn)라운드에 수행될 수 있음을 보인다. 이것은 m로세서 $\times$라운드의 바운드를 O(n/logn)으로 하는 것으로 이전까지 알려졌던 O(n)을 개선한 것이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.1012-1020
• /
• 2011

In this paper a design of $\pi$/4-DQPSK baseband receiver for the exchange of digital data and e-mail between shore and ship stations and/or among ship stations in the maritime mobile service VHF channels is described. Due to the permitted relatively big frequency instability of local oscillators at the transmitter and the receiver of maritime communication system, the designed baseband receiver should have the capabilities of correct estimation and compensation of the synchronization parameters, such as symbol timing and frequency offset, from the received signal which might include relatively big frequency error. Simulated BER results show that the designed baseband receiver works less than 0.5dB loss under AWGN channel when the normalized frequency offset of the received signal is more then 20%.

• The Korean Journal of Nuclear Medicine
• /
• v.36 no.6
• /
• pp.357-367
• /
• 2002

Purpose: While cerebral blood flow and cerebrovascular reserve could be evaluated with basal/acetazolamide Tc-99m-HMPAO SPECT in cerebrovascular disease, objective quantification is necessary to assess the efficacy of the revascularization. In this study we adopted the SPM method to quantify basal cerebral blood flow and cerebrovascular reserve on basal/acetazolamide SPECT in assessment of the patients who underwent bypass surgery for linternal carotid artery (ICA) stenosis. Materials and Methods: Twelve patients ($51{\pm}15$ years) with ICA stenosis were enrolled. Tc-99m-HMPAO basal/acetazolamide perfusion SPECT was peformed before and after bypass surgery. After spatia1 and count normalization to cerebellum, basal cerebral blood flow and cerebrovascular reserve were compared with 21 age-matched normal controls and postoperative changes of regional blood flow and reserve were assessed by Statistical Parametric Mapping method. Mean pixel values of each brain region were calculated using probabilistic anatomical map of lobes. Perfusion reserve was defined as the % changes after acetazolamide over basal counts. Results: Preoperative cerebral blood flow and cerebrovascular reserve were significantly decreased in involved ICA territory, comparing with normal control (p<0.05). Postoperative improvement of cerebral blood flow and cerebrovascular reserve was observed in grafted ICA territories, but cerebrovasculr reserve remained with significant difference with normal control. Improvement of the cerebrovascular reserve was most prominent in the superior temporal and the angular gyrus, nearest to the anastomosis sites. Conclusion: Using SPM quantification method on hasal/acetazolamide Tc-99m-HMPAO SPECT, the cerebral blood flow and cerebrovascular reserve could be assessed before revascularization and so could the efficacy of the bypass surgery.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.113-123
• /
• 2007

This paper presents a high-performance elliptic curve cryptographic processor over $GF(2^m)$. The proposed design adopts Lopez-Dahab Montgomery algorithm for elliptic curve point multiplication and uses Gaussian normal basis for $GF(2^m)$ field arithmetic operations. We select m=163 which is the smallest value among five recommended $GF(2^m)$ field sizes by NIST and it is Gaussian normal basis of type 4. The proposed elliptic curve cryptographic processor consists of host interface, data memory, instruction memory, and control. We implement the proposed design using Xilinx XCV2000E FPGA device. Based on the FPGA implementation results, we can see that our design is 2.6 times faster and requires significantly less hardware resources compared with the previously proposed best hardware implementation.

• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.37-44
• /
• 2003

The standard approach to signal resampling is to fit the original image to a continuous model and resample the function at a desired rate. We used the compact B-spline function as the continuous model which produces less oscillatory behavior than other tails functions. In the case of nonuniform resampling based on a B-spline model, the digital signal is fitted to a spline model, and then the fitted signal is resampled at a space varying rate determined by the transformation function. It is simple to implement but may suffer from artifacts due to data loss. The main purpose of this paper is the derivation of optimal nonuniform resampling algorithm. For the optimal nonuniform formulation, the resampled signal is represented by a combination of shift varying splines determined by the transformation function. This optimal nonuniform resampling algorithm can be verified from the experiments that It produces less errors.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.4
• /
• pp.550-563
• /
• 1999

A wavelet-Galerkin scheme based on the time-dependent Maxwell's equations is presented. Daubechies wavelet with two vanishing wavelet moments is expanded for basis function in spatial domain and Yee's leap-frog approach is applied. The shifted interpolation property of Daubechies wavelet family leads to the simplified formulations for inhomogeneous media without the additional matrices for the integral or material operator. The stability condition is formulated. The dispersion characteristics are analyzed and compared with those of finite difference time domain and multiresolution time domain methods. The analyses show the excellent trade-off between the regularity and the support width of the basis function. Although the basis function has only two vanishing wavelet moments, it is enough to provide negligible dispersive error in the numerical analysis and its compact support enables only several involved terms per nodes. The storage effectiveness, execution time reduction and accuracy of this scheme are demonstrated by calculating the resonant frequencies of the homogeneous and inhomogeneous cavities.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.2069-2073
• /
• 2007

효과적인 저수지 수질관리 대책을 수립하기 위해서는 상류 유역으로부터 오염원의 유출특성에 대한 정확한 이해가 필요하다. 강우시 대부분 유입하는 비점오염원은 실측에 많은 비용과 시간이 소요되어 부하량 산정에 어려움이 있어 전체 부하량에서 차지하는 기여도를 파악하는데 어려움이 있었다. 본 연구의 목적은 Digital Filter 기법을 이용하여 댐 유입량 수문곡선으로부터 유출성분을 분리하고, 강우시 유출하는 비점오염부하량을 산정하는 방법을 개발하는데 있다. 연구대상지역은 대청호를 선택하였다. 유출성분별 오염부하량을 정량화하기 위해 댐 유입량을 각각 지표유출, 중간유출 및 기저유출 성분으로 분리하고, 강우시 지표유출과 중간유출을 합하여 비점오염원 부하량(직접유출)으로 산정하였다. 유출성분별 일별 부하량은 실측된 유량 및 수질자료로부터 유도된 유량-부하량의 상관관계식을 적용하였다. 연구결과 대청호 유입량의 유출성분비는 각각 지표유출 49.2%, 중간유출 25.5% 및 기저유출 25.4%로 산정되었다. 2001년 옥천지점에서 유출성분분리 결과, 총 유출량 중 기저유출, 지표유출, 중간유출의 비가 각각 35.1%, 39.5%, 25.5%로 산정되었고, 청성지점은 각각 39.7%, 36.1%, 24.2%로 나타났다. $2001{\sim}2005$년까지 유출 성분별 비점오염원 부하량을 산정한 결과, 대청호에 비점오염원 부하량 기여율의 범위(평균값)는 각각 BOD $65.2{\sim}88.0%$(평균 83.5%), COD $68.1{\sim}$ 89.3%(평균 86.8%), T-N $60.4{\sim}88.6%$(평균 84.2%), 그리고 T-P $77.7{\sim}96.6%$(평균 94.3%)로 산정되었다. 이러한 결과는 대청호로 유입하는 유기물과 영양염류 연간 부하량의 80% 이상이 강우-유출과 함께 유입하는 것을 의미하며, 저수지 수질관리를 위해서는 유역차원의 비점오염원 관리가 시급함을 시사한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.115-121
• /
• 2006

The efficiency of the multiplier largely depends on the representation of finite filed elements such as normal basis, polynomial basis, dual basis, and redundant representation, and so on. In particular, the redundant representation is attractive since it can simply implement squaring and modular reduction. In this paper, we propose an efficient bit-parallel multiplier for GF(2m) defined by an irreducible all-one polynomial using a redundant representation. We modify the well-known multiplication method which was proposed by Karatsuba to improve the efficiency of the proposed bit-parallel multiplier. As a result, the proposed multiplier has a lower space complexity compared to the previously known multipliers using all-one polynomials. On the other hand, its time complexity is similar to the previously proposed ones.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.3-12
• /
• 1999

The public key crytptosystem is represented by RSA based on the difficulty of integer factorization and ElGamal cryptosystem based on the intractability of the discrete logarithm problem in a cyclic group G. The index-calculus algorithm for discrete logarithms in GF${$q^n$}^+$ requires an polynomial factorization. The Niederreiter recently developed deterministic facorization algorithm for polynomial over GF$q^n$ In this paper we implemented the arithmetic of finite field with c-language and gibe an implementation of the Niederreiter's algorithm over GF$2^n$ using normal bases.