| Summary: | 碩士 === 國立清華大學 === 電機工程學系 === 92 === The recent trends towards global networking and mobile computing have led to the proliferation of wireless networks which enable users to remain connected to the global web without being tied down to a fixed, wired link. The lack of a coherent wireless network security architecture has resulted in many different types of cryptographic primitives being used, requiring some form of
algorithm in order to maximize the portable systems’utility. In order to facilitate the secure transmission of funds over the Internet, cryptography must be used. Cryptography is therefore a key enabling technology for the Internet and E-commerce systems. Elliptic Curve ryptography (ECC) is evolving as an attractive alternative to other public-key cryptosystems such as the Rivest-Shamir-Adleman algorithm (RSA) by offering the smallest key size and the highest strength per bit and makeing it suitable for smart cards, cellular phones or any other resource constrained
applications. We propose an elliptic curve cryptographic processor than can support Galois fields GF(p) and GF(2^n) for arbitrary prime numbers and irreducible polynomials by a multi-function arithmetic unit (MAU). The MAU contained one montgomery multiplier, two binary field multipliers and one binary field divider accelertate the throughtput of the EC scalar multiplication. It can handle any gereric curves up to a field degree of 255. The experimental result
reports that the ECC processor can run at a clock rate of 384MHz and the hardware area of the ECC processor is about 200K gates. A 256-bit EC scalar multiplication takes 1.1 ms in GF(2^n) and 5.6ms in GF(p).
|
|---|
