Skip to main content

7 Result(s)

within Chun-Pyo Hong Remove this filter Computer Communication Networks Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    A Novel Arithmetic Unit over GF(2 m ) for Low Cost Cryptographic Applications

    We present a novel VLSI architecture for division and multiplication in GF(2 m ), aimed at applications in low cost elliptic curve cryptographic processors. A compact and fast ar...

    Chang Hoon Kim, Chun Pyo Hong… in High Performance Computing and Communications (2005)

  2. No Access

    Chapter and Conference Paper

    A New Digit-Serial Systolic Mulitplier for High Performance GF(2 m ) Applications

    This paper presents a new digit-serial systolic multiplier over GF(2 m ) for cryptographic applications. The proposed array is based on the most significant digit first (MSD-firs...

    Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong… in High Performance Computing and Communicati… (2005)

  3. Chapter and Conference Paper

    Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity

    XTR appeared in 2000 is a very promising alternative to elliptic curve cryptosystem. Though the basic idea behind XTR is very elegant and universal, one needs to restrict the primes p such as p ≡ 2 mod3 for optim...

    Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong in Selected Areas in Cryptography (2005)

    Download PDF (206 KB)

  4. Chapter and Conference Paper

    Efficient Linear Array for Multiplication in GF(2 m ) Using a Normal Basis for Elliptic Curve Cryptography

    We present a new sequential normal basis multiplier over GF(2 m ). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to t...

    Soonhak Kwon, Kris Gaj, Chang Hoon Kim… in Cryptographic Hardware and Embedded System… (2004)

    Download PDF (234 KB)

  5. No Access

    Chapter and Conference Paper

    A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation

    This paper proposes a new arithmetic unit (AU) in GF(2m) for reconfigurable hardware implementation such as FPGAs, which overcomes the well-known drawback of reduced flexibility that is associated with traditiona...

    Chang Hoon Kim, Soonhak Kwon, Jong ** Kim… in Field Programmable Logic and Application (2003)

  6. No Access

    Chapter and Conference Paper

    Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic

    We present an efficient exponentiation algorithm in a finite field GF(q n ) using a Gauss period of type (n,1). Though the Gauss period α of type (n,1) i...

    Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong in Algorithms and Computation (2003)

  7. Chapter and Conference Paper

    Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods

    We present a fast and compact hardware architecture of exponentiation in a finite field GF(2 n ) determined by a Gauss period of type (n,k) with k ≥ 2. Our construction is based ...

    Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong in Cryptographic Hardware and Embedded System… (2003)

    Download PDF (314 KB)