Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials

@article{Lee2007ScalableAS,
  title={Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials},
  author={Chiou-Yng Lee and Che Wun Chiou and Jim-Min Lin and Chin-Chen Chang},
  journal={IET Circuits, Devices & Systems},
  year={2007},
  volume={1},
  pages={477-484}
}
A Montgomery’s algorithm in GF(2) based on the Hankel matrix–vector representation is proposed. The hardware architecture obtained from this algorithm indicates low-complexity bit-parallel systolic multipliers with irreducible trinomials. The results reveal that the proposed multiplier saves approximately 36% of space complexity as compared to an existing systolic Montgomery multiplier for trinomials. A scalable and systolic Montgomery multiplier is also developed by applying the block-Hankel… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS
26 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Digit-serial AB2 systolic architecture in GF(2)

  • Kim, N.-Y, Yoo, K.-Y
  • IEE Proc., Circuits Devices Syst.,
  • 2005

‘ Digitserial AB 2 systolic architecture in GF ( 2 m ) ’ ,

  • N.-Y. Kim, K.-Y. Yoo
  • IEE Proc . , Circuits Devices Syst .
  • 2005

Similar Papers

Loading similar papers…