• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.4
• /
• pp.41-46
• /
• 2004

This paper presents a new semi- systolic architecture for $AB^2$ operation. First of all the previous architecture proposed by Lee et al. is analysed and then we present a new algorithm and it's architecture for $AB^2$ operation based on AOP (all one polynomial) to solve the shortcomings in the architecture. Proposed architecture has an efficient configuration than other previous architectures. It is useful for implementing the exponentiation architecture, which is the core operation in public-key cryptosystems.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.217-223
• /
• 2002

The paper presents a single constraint equation of the direct kinematic solution of 6-dof (Stewart-Gough) platforms. Many research works have presented a single polynomial of the direct kinematics for several 6-dof platforms. However, the formulation of the polynomial has potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots. This results in heavy computational burden and time-consuming task. Thus, to overcome these problems, we use a new formulation approach, called the Tetrahedron Approach, to easily derive a single constraint equation, not a polynomial one, of the direct kinematics and use two well-known numerical iterative methods to find the solution of the single constraint equation. Their performance and characteristics are investigated through a series of simulation.

• Journal of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.871-894
• /
• 1997

For a lifted nontrivial additive character $\lambda'$ and a multiplicative character $\chi$ of the finite field with $q^2$ elements, the 'Gauss' sums $\Sigma\lambda'$(tr $\omega$) over $\omega$ $\in$ SU(2n + 1, $q^2$) and $\Sigma\chi$(det $\omega$)$\lambda'$(tr $\omega$) over $\omega$ $\in$ U(2n + 1, $q^2$) are considered. We show that the first sum is a polynomial in q with coefficients involving certain new exponential sums and that the second one is a polynomial in q with coefficients involving powers of the usual twisted Kloosterman sums and the average (over all multiplicative characters of order dividing q-1) of the usual Gauss sums. As a consequence we can determine certain 'generalized Kloosterman sum over nonsingular Hermitian matrices' which were previously determined by J. H. Hodges only in the case that one of the two arguments is zero.

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

In this contributions, we propose a new MSB(most significant bit) algorithm based on AOP(All One Polynomial) and two parallel semi-systolic architectures to computes $AB^2$over finite field $GF(2^m)$. The proposed architectures are based on standard basis and use the property of irreducible AOP(All One Polynomial) which is all coefficients of 1. The proposed parallel semi-systolic architecture(PSM) has the critical path of $D_{AND2^+}D_{XOR2}$ per cell and the latency of m+1. The modified parallel semi-systolic architecture(WPSM) has the critical path of $D_{XOR2}$ per cell and has the same latency with PSM. The proposed two architectures, PSM and MPSM, have a low latency and a small hardware complexity compared to the previous architectures. They can be used as a basic architecture for exponentiation, division, and inversion. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation. They can be used as a basic architecture for algorithms, such as the Diffie-Hellman key exchange scheme, the Digital Signature Algorithm(DSA), and the ElGamal encryption scheme which are needed exponentiation operation. The application of the algorithms can be used cryptosystem implementation based on elliptic curve.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.2
• /
• pp.93-98
• /
• 2003

This paper presents two new algorithms and their architectures for $AB^2 $ multiplication over $GF(2^m)$.First, a new architecture with a new algorithm is designed based on LFSR (Linear Feedback Shift Register) architecture. Furthermore, modified $AB^2 $ multiplier is derived from the multiplier. The multipliers and the structure use AOP (All One Polynomial) as a modulus, which hat the properties of ail coefficients with 1. Simulation results thews that proposed architecture has lower hardware complexity than previous architectures. They could be. Therefore it is useful for implementing the exponential ion architecture, which is the tore operation In public-key cryptosystems.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.4 s.193
• /
• pp.93-101
• /
• 2007

Aluminum alloy which is one of the light materials has been tried to apply to light weight vehicle body. In order to do that, welding technology is very important. In case of the aluminum laser welding, the strength of welded part is reduced due to porosity, underfill, and magnesium loss. To overcome these problems, laser welding of aluminum with filler wire was suggested. In this study, experiment about laser welding of AA5182 aluminum alloy with AA5356 filler wire was performed according to process parameters such as laser power, welding speed and wire feed rate. The tensile strength was measured to find the weldability of laser welding with filler wire. The models to estimate tensile strength were suggested using three regression models and one neural network model. For regression models, one was the multiple linear regression model, another was the second order polynomial regression model, and the other was the multiple nonlinear regression model. Neural network model with 2 hidden layers which had 5 and 3 nodes respectively was investigated to find the most suitable model for the system. Estimation performance was evaluated for each model using the average error rate. Among the three regression models, the second order polynomial regression model had the best estimation performance. For all models, neural network model has the best estimation performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.176-180
• /
• 2004

The ST-segment that the beginning part of T wave is the important diagnostic parameter to finding myocardial ischemia. Abnormal ST appears in two types. One is the level change, and the other is the pattern change. In this paper, we describe the monitoring of abnormal ST using PC based system. Hardware of this system consists of transmitter, receiver and PC. The function of transmitter is measuring ECG in three channels which are selected manually and transmitting the data to receiver by digital radio way. Connection with receiver and PC is by RS232C, and the data received on the PC is analyzed automatically by ECG analysis algorithm and saved to file. In the algorithm part for detecting abnormal ST, ST-segments are approximated by a polynomial. This method can detect all of the deviation and pattern change of ST-segment regardless the change in the heart rate or sampling rate. To gain algorithm reliability, the method rejects distorted polynomial approximation by calculation the difference between the approximated ST-segment and original ST-segment. In pre-signal processing, the wavelet transformation separates high frequency bands including QRS complex from the original ECG. Consequently, the process improves the performance of detecting each feature points.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.3
• /
• pp.387-393
• /
• 2015

In Electronic Commerce and Secret Communication based on ECC over finite field, if the sender and the receiver use different basis of finite fields, then the time of communication should always be delayed. In this paper, we analyze the number of bases-transformations needed for Electronic Signature in Electronic Commerce and Secret Communication based on ECC over finite field between H/W and S/W implementation systems and introduce the anomalous basis of finite fields using AOP which is efficient for H/W, S/W implementation systems without bases-transformations for Electronic Commerce and Secret Communication. And then we propose a new multiplier based on the anomalous basis of finite fields using AOP which reduces the running time by 25% than that of the multiplier based on finite fields using trinomial with polynomial bases.

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

More concerns are concentrated in finite fields arithmetic as finite fields being applied for Elliptic curve cryptosystem coding theory and etc. Finite fields arithmetic is affected in represen -tation of those. Optimal normal basis is effective in hardware implementation and polynomial field which is effective in the basis conversion with optimal normal basis and show that the arithmetic of finite field with the basis is effective in software implementation.

• East Asian mathematical journal
• /
• v.16 no.1
• /
• pp.71-79
• /
• 2000

We show that the intersection of two standard torus knots of type (${\lambda}_1$, ${\lambda}_2$) and (${\beta}_1$, ${\beta}_2$) induces an automorphism of the cyclic group ${\mathbb{Z}}_d$, where d is the intersection number of the two torus knots and give an elementary proof of the fact that all non-trivial torus knots are strongly invertiable knots. We also show that the intersection of two standard knots on the 3-torus $S^1{\times}S^1{\times}S^1$ induces an isomorphism of cyclic groups.