摘要
Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation part. In this paper an efficient tradeoff multiplier implementation between full parallel and full serial multiplier is proposed based on optimal normal basis of type II and shifted canonical basis. Experiments show that the multiplier is suitable to realize in FPGA device.
源语言 | 英语 |
---|---|
主期刊名 | Proceedings - ISDA 2006 |
主期刊副标题 | Sixth International Conference on Intelligent Systems Design and Applications |
页 | 1132-1135 |
页数 | 4 |
DOI | |
出版状态 | 已出版 - 2006 |
活动 | ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications - Jinan, 中国 期限: 16 10月 2006 → 18 10月 2006 |
出版系列
姓名 | Proceedings - ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications |
---|---|
卷 | 1 |
会议
会议 | ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications |
---|---|
国家/地区 | 中国 |
市 | Jinan |
时期 | 16/10/06 → 18/10/06 |
指纹
探究 'Efficient multiplier over finite field represented in type II optimal normal basis' 的科研主题。它们共同构成独一无二的指纹。引用此
Wang, Y., Tian, Z., Bi, X., & Niu, Z. (2006). Efficient multiplier over finite field represented in type II optimal normal basis. 在 Proceedings - ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications (页码 1132-1135). 文章 4021598 (Proceedings - ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications; 卷 1). https://doi.org/10.1109/ISDA.2006.138