15 Result(s)

within Chapter Chun-Pyo Hong

Sort By Newest First Oldest First

Chapter and Conference Paper

Construction of Group Rules for VLSI Application

An application of cellular automata (CA) has been proposed for building parallel processing systems, cryptographic hashing functions, and VLSI technology. Recently, Das et al. have reported characterization of...

Byung-Heon Kang, Dong-Ho Lee, Chun-Pyo Hong in Advances in Computer and Information Scien… (2008)
Chapter and Conference Paper

Pseudorandom Number Generation Using Cellular Automata

High-performance pseudorandom number generators (PRNGs) play an important role in a variety of applications like computer simulations, and industrial applications including cryptography. High-quality PRNG can ...

Byung-Heon Kang, Dong-Ho Lee, Chun-Pyo Hong in Novel Algorithms and Techniques In Telecom… (2008)
Chapter and Conference Paper

Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2^m) Using LSB First Algorithm

The two dimensional systolic array for multiplication in binary field GF(2^m) with LSB (Least Significant Bit) first algorithm proposed by Yeh et al. has the unfavorable propert...

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong in Fuzzy Logic and Applications (2006)
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)
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)
Chapter

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

In order to overcome the well-known drawback of reduced flexibility that is associated with traditional ASIC solutions, this paper proposes a new arithmetic unit (AU) in GF(2^m) for reconfigurable hardware impleme...

Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon… in New Algorithms, Architectures and Applicat… (2005)
Chapter and Conference Paper

Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2^m) for High Speed Cryptographic Processors

Many of the cryptographic schemes over small characteristic finite fields are efficiently implemented by using a trinomial basis. In this paper, we present new linear systolic arrays for multiplication in GF(2^...

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong in Computational Science and Its Applications… (2005)
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)
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)
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)
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)
Chapter and Conference Paper

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

This paper proposes a new arithmetic unit (AU) in GF(2^m) 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)
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 ⁿ) 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)
Chapter and Conference Paper

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

Division over a finite field GF(2^m) is the most time and area consuming operation. In this paper, A new division architecture for GF(2^m) 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)
Chapter and Conference Paper

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

We present a fast and compact hardware architecture of exponentiation in a finite field GF(2ⁿ) 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)

15 Result(s)

Construction of Group Rules for VLSI Application

Pseudorandom Number Generation Using Cellular Automata

Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2^m) Using LSB First Algorithm

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

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

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

Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2^m) for High Speed Cryptographic Processors

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

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

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

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

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

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

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

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

Our Content

Other Sites

Help & Contacts