Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    A New Systolic Array for Least Significant Digit First Multiplication in GF(2 m )

    This paper presents a new digit-serial systolic multiplier over GF(2 m ) for cryptographic applications. When input data come in continuously, the proposed array produces multipl...

    Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong in Computational Science and Its Applications… (2004)

  2. No Access

    Chapter and Conference Paper

    A Linear Systolic Array for Multiplication in GF(2 m ) for High Speed Cryptographic Processors

    We present new designs of low complexity and low latency systolic arrays for multiplication in GF(2 m ) when there is an irreducible all one polynomial (AOP) of degree m. Our pro...

    Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong in Computational Science and Its Applications… (2004)

  3. No Access

    Chapter and Conference Paper

    A Compact and Fast Division Architecture for a Finite Field GF(2m)

    Division over a finite field GF(2m) is the most time and area consuming operation. In this paper, A new division architecture for GF(2m) using the standard basis representation is proposed. Based on a modified ve...

    Chang Hoon Kim, Soonhak Kwon, Jong ** Kim in Computational Science and Its Applications… (2003)