• The Journal of the Korea Contents Association
• /
• v.20 no.1
• /
• pp.356-363
• /
• 2020

As a becoming era of Internet-of-Things, various devices are connected via wire or wirless networks. Although every day life is more convenient, security problems are also increasing such as privacy, information leak, denial of services. Since ECC, a kind of public key cryptosystem, has a smaller key size compared to RSA, it is widely used for environmentally constrained devices. The key of ECC in constrained devices can be exposed to power analysis attacks during scalar multiplication operation. In this paper, a key-randomization method is suggested for scalar multiplication on SECG parameters. It is against differential power analysis and has operational efficiency. In order to increase of operational efficiency, the proposed method uses the property 2^lP=∓cP where the constant c is small compared to the order n of SECG parameters and n=2^l±c. The number of operation for the Coron's key-randomization scalar multiplication algorithm is 21, but the number of operation for the proposed method in this paper is (3/2)l. It has efficiency about 25% compared to the Coron's method using full random numbers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.11
• /
• pp.941-947
• /
• 2002

Two methods of constructing T-S fuzzy model which is equivalent to a given nonlinear system are presented. The first method is to obtain an equivalent T-S fuzzy model by using the sum of linearly independent scalar functions with constant real matrix coefficients. The sum of products of linearly independent scalar functions is used in the second method. The former method is to formulate the procedures of T-S fuzzy modeling dealt in many examples of previous publications; the latter is a new method. By comparing the number of linearly independent functions used in the two methods, we can easily find out which method makes fewer rules than the other. The nonlinear dynamics of an inverted Pendulum on a cart is used as an equivalent T-5 fuzzy modeling example.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.5
• /
• pp.45-51
• /
• 2002

As Koblitz curve, the Frobenius endomorphism is know to be useful in efficient implementation of multiplication on non-supersingular elliptic cures defined on small finite fields of characteristic two. In this paper a method using the extended Frobenius endomorphism to speed up scalar multiplication is introduced. It will be shown that the proposed method is more efficient than Muller's block method in ［5］ because the number of point addition for precomputation is small but on the other hand the expansion length is almost same.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.33 no.5
• /
• pp.167-172
• /
• 1984

This paper describes the finite element analysis of magnetostatic field problems with permanent magnets. Two kinds of algorithms, one using the magnetic vector potential and the other using the magnetic scalar potential, are introduced. The magnetization of the pemanent magnet is used as the source instead of the magnetic equivalent current in both of the formulations using the magnetic vector potential and the magnetic scalar potential. A simple functional, which has only the region integral instead of the region integral and boundary integral, is derived in the formulation using the magnetic scalar potential. These make the formulation of the system equations simpler and more convenient than the conventional methods. The numerical results by the two proposed algorithms for a C-type permanent magnet model are compared with the analytic solutions respectively. The numerical results are in good agreement with the analytic solutions.

• International Journal of Aeronautical and Space Sciences
• /
• v.3 no.2
• /
• pp.88-94
• /
• 2002

This paper describes attitude determination algorithm for the low earth orbit(LEO) spacecraft using stellar inertial sensors. The cascaded gyro/star tracker extended Kalman filter is constructed to fuse two sensor data. And then the smoothing of the measurement are proposed for an unreasonable jump of star tracker. The smoothing algorithm for the rejection of star tracker error jumps is designed by scalar adaptive filter. The proposed algorithms operate to process the measurement of gyro/star tracker Kalman filter, therefore, it is comparatively simple to apply these methods to other integration systems. Simulations to gyro/star tracker integrated system show that the proposed method is effective.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.521-526
• /
• 2009

In this paper, a complex-valued recursive least squares escalator filter algorithm with reduced computational complexity for complex-valued signal processing applications is presented. The local tap weight of RLS-ESC algorithm is updated by incrementing its old value by an amount equal to the local estimation error times the local gain scalar, and for the gain scalar, the local input autocorrelation is calculated at the previous time. By deriving a new gain scalar that can be calculated by using the current local input autocorrelation, reduced computational complexity is accomplished. Compared with the computational complexity of the complex-valued version of RLS-ESC algorithm, the computational complexity of the proposed method can be reduced by 50% without performance degradation. The reduced computational complexity of the proposed algorithm is even less than that of the LMS-ESC. Simulation results for complex channel equalization in 64QAM modulation schemes demonstrate that the proposed algorithm has superior convergence and constellation performance.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.4
• /
• pp.375-385
• /
• 2020

In this paper, a special indefinite inner product, named hyperbolic scalar product, is used and all acquired results have been raised and proved with the proviso that the space is equipped with this indefinite scalar product. The main objective is to be introduced and applied an indefinite oblique projection method, called Indefinite Lanczos J-biorthogonalizatiom process, which in addition to building a pair of J-biorthogonal bases for two used Krylov subspaces, leads to the introduction of a process for solving large non-J-symmetric linear systems, i.e., Indefinite two-sided Lanczos Algorithm for Linear systems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.1
• /
• pp.81-88
• /
• 2002

For efficient implementation of scalar multiplication in Elliptic Curve Cryptosystems over Small Fields of Odd Characterist, robenius endomorphism is useful. We discuss new algorithm for multiplying points on Elliptic Curve Cryptosystems over Small ields. Our algorithm can reduce more the length of the Frobenius expansion than that of Smart.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.3-10
• /
• 2007

A new approach based on implicit surface interpolation combined with domain decomposition is proposed for filling complex-shaped holes in a large polygon model, A surface was constructed by creating a smooth implicit surface from an incomplete polygon model through which the actual surface would pass. The implicit surface was defined by a radial basis function, which is a continuous scalar-value function over the domain $R^{3}$. The generated surface consisted of the set of all points at which this scalar function is zero. It was created by placing zero-valued constraints at the vertices of the polygon model. The well-known domain decomposition method was used to treat the large polygon model. The global domain of interest was divided into smaller domains in which the problem could be solved locally. The LU decomposition method was used to solve the set of small local problems; the local solutions were then combined using weighting coefficients to obtain a global solution. The validity of this new approach was demonstrated by using it to fill various holes in large and complex polygon models with arbitrary topologies.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.4
• /
• pp.305-316
• /
• 2014

The Hodge-Helmholtz decomposition splits a vector field into the unique sum of a divergence-free vector field (solenoidal part) and a gradient field (irrotational part). In a bounded domain, a boundary condition needs to be supplied to the decomposition. The decomposition with the non-penetration boundary condition is equivalent to solving the Poisson equation with the Neumann boundary condition. The Gibou-Min method is an application of the Poisson solver by Purvis and Burkhalter to the decomposition. Using the $L^2$-orthogonality between the error vector and the consistency, the convergence for approximating the divergence-free vector field was recently proved to be $O(h^{1.5})$ with step size h. In this work, we analyze the convergence of the irrotattional in the decomposition. To the end, we introduce a discrete version of the Poincare inequality, which leads to a proof of the O(h) convergence for the scalar variable of the gradient field in a domain with general intersection property.