• 한국정보과학회논문지:시스템및이론
• /
• 제31권10호
• /
• pp.588-592
• /
• 2004

스칼라 곱셈은 정수 $textsc{k}$와 타원곡선 상의 한 점 P가 주어졌을 때 $textsc{k}$P를 계산하는 연산이다. 스칼라 곱셈을 빠르게 하기 위한 일반적인 방법으로 Agnew Mullin, Vanstone은 고정된 값의 해밍 웨이트를 갖는 스칼라 $textsc{k}$를 이용하는 방법을 제안하였다. 본 논문에서는 고정된 값의 부호화 해밍 웨이트를 갖는 $textsc{k}$를 이용하는 방법을 제안하고, 이 방법이 더 안전함을 보인다.

• Structural Engineering and Mechanics
• /
• 제23권3호
• /
• pp.263-278
• /
• 2006

This work presents a time-truncation scheme, based on the Lagrange interpolation polynomial, for the solution of the two-dimensional scalar wave problem by the time-domain boundary element method. The aim is to reduce the number of stored matrices, due to the convolution integral performed from the initial time to the current time, and to keep a compromise between computational economy and efficiency and the numerical accuracy. In order to verify the accuracy of the proposed formulation, three examples are presented and discussed at the end of the article.

• 대한수학회보
• /
• 제52권6호
• /
• pp.1945-1962
• /
• 2015

This paper is mainly concerned with the formation of delta standing wave for the scalar conservation law with a linear flux function involving discontinuous coefficients by using the self-similar viscosity vanishing method. More precisely, we use the self-similar viscosity to smooth out the discontinuous coefficient such that the existence of approximate viscous solutions to the delta standing wave for the Riemann problem is established and then the convergence to the delta standing wave solution is also obtained when the viscosity parameter tends to zero. In addition, the Riemann problem is also solved with the standard method and the instability of Riemann solutions with respect to the specific small perturbation of initial data is pointed out in some particular situations.

• Journal of Magnetics
• /
• 제18권2호
• /
• pp.95-104
• /
• 2013

This paper presents a general analytical method for predicting the magnetic fields of different Halbach magnet arrays with or without back iron mounted on slotless permanent magnet (PM) linear machines. By using Fourier decomposition, the magnetization components of four typical Halbach magnet arrays are determined. By applying special synthetic boundary conditions on the PM surfaces, the expressions of their magnetic field distributions are derived based on the magnetic scalar potential (MSP), which are simpler than those based on the magnetic vector potential (MVP). The correctness of the method is validated by finite element analysis. The harmonics of airgap flux density waveforms of these Halbach magnet arrays with or without back iron are also compared and optimized.

• 소성∙가공
• /
• 제12권6호
• /
• pp.572-581
• /
• 2003

In this paper, an automatic surface construction method based on B-spline surface and scalar field theory is proposed to generate the extrusion die surface of non-symmetric H-and U-shaped sections. The isothermal lines and stream lines designed in the scalar field are introduced to find the control points which are used in constructing B-spline surfaces. Intersected points between the isothermal lines and stream lines are used to construct B-spline surfaces. The inlet and outlet profiles are precisely described with B-spline curves by using the centripetal method for uniform parameterization. The extrusion die surface is generated by using the cubic curve interpolation in the u-and v-directions. A quantitative measure for the control of surface is suggested by introducing the tangential vectors at the inlet and outlet sections. To verify the validity of the proposed method, automatic surface generation is carried out for extrusion die of non-symmetric H-and U-shaped sections.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2003년도 동계학술대회
• /
• pp.412-416
• /
• 2003

This paper introduces a new joint signed expansion method for computing simultaneous scalar multiplication on an elliptic curve and a modified binary algorithm for efficient use of the new expansion method. The proposed expansion method can be also be used in cryptosystems such as RSA and EIGamal cryptosystems.

• East Asian mathematical journal
• /
• 제39권5호
• /
• pp.529-536
• /
• 2023

This paper introduces the Frobenius endomophisms on the binary Hessian curves. It provides an efficient and computable homomorphism for computing point multiplication on binary Hessian curves. As an application, it is possible to construct the GLV method combined with the Frobenius endomorphism to accelerate scalar multiplication over the curve.

• 전자공학회논문지S
• /
• 제34S권4호
• /
• pp.50-56
• /
• 1997

In this paper, efficient quantization methods of line spectrum pairs (LSP) which has good performances and low complexity and memory are proosed for vocoder of mobile communication system. The adaptive quantization method utilizing the ordering property of LSP parameters is used in a scalar quantizer and a vector-scalar hybrid quantizer. The proposed scalar quantization algorithm needs 31 bits/frame to maintain the transparent quality of speech. The improved vector-scalar quantizer achieves an average spectral distortion of 1dB using 26 bits/frame. The proposed methods are evaluated in the channel errors and changed the predictor structure to maintain the robustness to channel errors.

• 한국통신학회논문지
• /
• 제21권2호
• /
• pp.333-339
• /
• 1996

In this paper, an effiicent quatization method of line spectrum pairs(LSP) with cascaded structure of vector quantizer and scalar quantizer is proposed. First, input LSP parameters is vector-quantized using a codebook with a moderate number of entries. In the second stage of quantization, the components of residual vector are individution improve the quantizer by the scalar quantizer. The utilization of ordering property and the inclusion of interframe prediction improve the quantizer performance and remove the stability check routine. The new vector-scalar cascaded quantizer using 27 bits/frame shows a transparent quality that an average specytural distortion is 1 dB and the frame proportion with above 2 dB spectral distion is less than 2%.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2004년도 SMICS 2004 International Symposium on Maritime and Communication Sciences
• /
• pp.49-52
• /
• 2004

Scalar multiplication is the back-bone operation in the elliptic curve cryptosystem. Quad-and-add algorithm replaced the traditional double-and-add algorithm to compute the scalar multiplication. In this paper, we introduce the method of utilizing the point quadruple scalar operation in the elliptic curve cryptosystem. Induced expressions were applied to real cryptosystem and proven at C language level. Point quadruple operation can be utilized to fast and efficient computation in the elliptic curve cryptosystem.