@inproceedings{c94896a4a62248fd9221cdbe3b4f9e5c,
title = "Compact bit-parallel systolic montgomery multiplication over GF(2 m) generated by trinomials",
abstract = "This paper presents a scalable and systolic Montgomery's algorithm in GF(2m) using the Hankel matrix-vector representation. The hardware architectures derived from this algorithm represents low-complexity bit-parallel systolic multipliers with trinomials. The results reveal that our proposed multiplier saves approximately 36% space complexity as compared to an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnect ability. Accordingly, they are well suited for VLSI implementation.",
keywords = "Bit-parallel systolic multiplier, Hankel matrix-vector, Trinomial",
author = "Lee, {Chiou Yng} and Chen, {Chin Chin} and Lu, {Erl Huei}",
year = "2006",
doi = "10.1109/TENCON.2006.343995",
language = "英语",
isbn = "1424405491",
series = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2006 IEEE Region 10 Conference, TENCON 2006",
address = "美国",
note = "2006 IEEE Region 10 Conference, TENCON 2006 ; Conference date: 14-11-2006 Through 17-11-2006",
}