New viewpoint of bit-serial/parallel normal basis multipliers using irreducible all-one polynomial

@article{Chen2006NewVO,
  title={New viewpoint of bit-serial/parallel normal basis multipliers using irreducible all-one polynomial},
  author={Zih-Heng Chen and Ming-Haw Jing and Jian-Hong Chen and Yaotsu Chang},
  journal={2006 IEEE International Symposium on Circuits and Systems},
  year={2006},
  pages={4 pp.-}
}
Recently, normal bases have been an appealing technique for hardware implementation in many applications, especially when finite fields are very large, such as the public key cryptosystems. In this article, a new viewpoint is introduced for performing the multiplication in the normal basis representation over binary field where the field defining irreducible polynomial is an all-one polynomial. The proposed multipliers carry out the normal basis multiplication by using extended polynomial basis… CONTINUE READING
3 Citations
6 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

The low latency Masseybased on discrete logarithms," IEEE Trans. Inform. Theory, vol. IT- Omura multiplier over GF(2')

  • T. ElGamal, A public key cryptosystem, a signature scheme M.H. Jing, T. K. Truong, Z. H. Chen
  • Proc. IEEE Asia-Pacific Conf 31, pp. 469-472…
  • 1985
1 Excerpt

Bit - serial cY cles multiplication in GF ( 2 ' ) using irreducible all - one polynomials

  • B. Sunar

COMPARISION OF BIT - PARALLEL NORMAL BASIS of VLSI architecture of finite field multipliers using dual , normal , or MULTIPLIER standard bases

  • M. G. Parker, M. Benaissa, D. Taylor
  • IEEE Trans . Compt .

Polynomial codes over certain finite fields

  • L. J. Deutsch

Similar Papers

Loading similar papers…