• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1995.11a
• /
• pp.173-182
• /
• 1995

모듈라 멱승(modular exponentiation) 연산은 암호학에서 기본적이고 중요한 연산이다. 그러나, 이는 다정도 정수(multiple precision integer)들을 다루기 때문에 그 연산시 간이 무척 많이 걸리므로 이를 단축시킬 필요가 있다. 모듈라 멱승 연산은 모듈라 곱셈(modular multiplication)의 반복으로서, 전체 연산시간을 단축시키기 위해서는 모듈라 곱셈의 수행시간을 단축시키거나, 모듈라 곱셈의 반복횟수를 줄이는 것이 필요하다. 본 논문에서는 모듈라 곱셈을 빠르게 수행하기 위한 알고리즘 두 개를 제안한다. 하나는 서로 다른 두 수의 모듈라 곱셈 알고리즘이고, 다른 하나는 모듈라 제곱을 빠르게 수행하는 알고리즘이다. 이 둘은 기존의 모듈라 곱셈 알고리즘들에 비해 각각 절반과, l/3가량의 단정도 곱셈(single-precision multiplication)만을 필요로 한다. 실제로 PC상에서 구현한 결과 각각 100%와 30%의 속도향상을 보인다.

• 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 Institute of Electronics Engineers of Korea SC
• /
• v.38 no.5
• /
• pp.7-13
• /
• 2001

Modular wavelet neural network combining wavelet theory and modular concept based on single layer neural network have been proposed as an alternative to conventional wavelet neural network and kind of modular network. In this paper, an effective method to construct an optimal modular wavelet network is proposed using genetic algorithm. Genetic Algorithm is used to determine dilations and translations of wavelet basis functions of wavelet neural network in each module. We apply the proposed algorithm to approximation problem and evaluate the effectiveness of the proposed system and algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.36-42
• /
• 2007

According to the increased demand of high quality multimedia content, it needs to recover an old movies. But the film of old movie is damaged with line scratches and dust. In this paper, the detection and restoration algorithm of B/W line scratch is proposed. Our scheme estimates and interpolates the damaged partial information of line scratch using the linear recursive curve trace which consider the intensity values of left and right region of line scratch and then median filtering processed. As a result, the film image PSNR 44.68 with B/W line scratch is increased up to 48.60 and the intensity of the interpolate pixel is approached about 14 against the pixel of original image.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.8
• /
• pp.723-731
• /
• 2009

In this paper, we propose a novel sound field reconstruction algorithm using a three dimensional loudspeaker array for providing realistic sound field to multiple listeners. The proposed algorithm is based on minimization of the squared error between the original sound field and the reconstructed sound field by the loudspeaker array over a predefined three dimensional region of the space using a loudspeaker array surrounding the listening area. For evaluating the proposed algorithm, we constructed the three dimensional array composed of 40 loudspeakers and discuss the relevant experiment results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3C
• /
• pp.256-262
• /
• 2002

This paper presents a novel radix-4 modular multiplication algorithm based on the sign estimation technique (3). The sign estimation technique detects the sign of a number represented in the form of a carry-sum pair. It can be implemented with 5-bit carry look-ahead adder. The hardware speed of the cryptosystem is dependent on the performance modular multiplication of large numbers. Our algorithm requires only (n/2+3) clock cycle for n bit modulus in performing modular multiplication. Our algorithm out-performs existing algorithm in terms of required clock cycles by a half, It is efficient for modular exponentiation with large modulus used in RSA cryptosystem. Also, we use high-speed adder (7) instead of CPA (Carry Propagation Adder) for modular multiplication hardware performance in fecal stage of CSA (Carry Save Adder) output. We apply RL (Right-and-Left) binary method for modular exponentiation because the number of clock cycles required to complete the modular exponentiation takes n cycles. Thus, One 1024-bit RSA operation can be done after n(n/2+3) clock cycles.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.670-672
• /
• 1999

소인수 분해 문제 혹은 이산대수 문제의 어려움에 근거한 공개키 암호 시스템에서는 큰 수에 대한 모듈라 멱승연산이 전체 시스템의 속도를 좌우하는 큰 요인이 된다. 모듈라 멱승 연산은 모듈라 곱셈으로 이루어진 연산이므로 모듈라 곱셈의 횟수를 줄이거나 빠른 모듈라 곱셈을 이용하면 멱승 연산의 계산 속도가 향상한다. 모듈라 곱셈 방법 중에서도 메모리를 적게 사용하면서도 고속인 방법들을 골라 비교하여 본다.

• KSBB Journal
• /
• v.4 no.3
• /
• pp.203-207
• /
• 1989

Software for the on-line feedback control of such variables as DO and temperature was developed and tested successfully for a real fermentation system. Several aspects like Pl, PID, DSC, and DDC were incorporated into the algorithm. Any kind of on-line computer control system can be successfully implemented without much difficulty.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.313-315
• /
• 2003

분할 및 합병 개념에 바탕을 둔 모듈라 신경망이 자동차 번호판 문자 인식에서 단일 신경망 사용 보다 학습 질 측면이나 학습 속도 면에서 좋은 결과를 보였다. 본 논문에서는 번호판 인식을 위한 모듈라 신경망 구성 시, 특징 벡터 클러스터링 방법에 따른 모듈라 신경망의 성능을 평가하였다. K-means Clustering 알고리즘을 이용하여 유사한 특징 벡터를 그룹핑하는 방법과 본 논문에서 제안한 알고리즘을 사용하여 유사하지 않는 특징 벡터들을 그룹핑하는 방법 각각을 구현하여 실험하였다. 실험결과, 유사하지 않는 특징 벡터들로 모듈라 신경망을 구성할 경우가 그렇지 않은 경우보다 좋은 인식 결과를 보였다.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.691-702
• /
• 2011

Recently, several researchers have attempted to combine human visual perception and computer graphics. Cole et. al. suggest the study results in which line drawing algorithm in computer graphics characterize the properties of line drawing made by artists. The paper also evaluates CG line drawing algorithms depending on whether people recognize effectively specific 3D shape from the image made by those CG line drawing algorithms. However, human recognizes the shape of objects more effectively in image made by BRDF shading model than line drawing algorithm. It means that the shading factor is important to recognize shape with human perception. In this paper, we analyze the correlation between shading made by human artists and that made by CG shading algorithms. The study is to characterize the mathematical properties of artists' shading and CG shading. This type of analysis can guide the future development of new CG shading algorithm in computer graphics for the purpose of shape perception.