• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.5 s.182
• /
• pp.119-127
• /
• 2006

Design structure of a mobile phone has been changed to a converged style, which has so many functions. However, the converged mobile phone could not satisfy the users who want to use only specific functions, so with Axiomatic Design, we have studied for making a proposal to set up the new concept. The goal of this study is to derive a general solution with Axiomatic Design to verify the Independence. By enhancing the existing design model and differentiating the function of mobile phone, user will be able to choose desirable products, which have only specific functions and/or specific parts. First of all, we checked the Independence about the existing design model. Then, we developed the new design model with the idea that base mobile phone should have basic functions and additional functions can be separated, surely be connected when users want.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.9 s.339
• /
• pp.51-60
• /
• 2005

The design of efficient cryptosystems is mainly appointed by the efficiency of the underlying finite field arithmetic. Especially, among the basic arithmetic over finite field, the rnultiplicative inversion is the most time consuming operation. In this paper, a fast inversion algerian in finite field $GF(2^m)$ with the standard basis representation is proposed. It is based on the Extended binary gcd algorithm (EBGA). The proposed algorithm executes about $18.8\%\;or\;45.9\%$ less iterations than EBGA or Montgomery inverse algorithm (MIA), respectively. In practical applications where the dimension of the field is large or may vary, systolic array sDucture becomes area-complexity and time-complexity costly or even impractical in previous algorithms. It is not suitable for low-weight and low-power systems, i.e., smartcard, the mobile phone. In this paper, we propose a new hardware architecture to apply an area-efficient and a synchronized inverter on low-complexity systems. It requires the number of addition and reduction operation less than previous architectures for computing the inverses in $GF(2^m)$ furthermore, the proposed inversion is applied over either prime or binary extension fields, more specially $GF(2^m)$ and GF(P) .