共 50 条
- [1] Parallel Montgomery multiplication and squaring over GF(2m) based on cellular automata [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 4, 2004, 3046 : 196 - 205
- [2] Fast and Pipelined Bit-Parallel Montgomery Multiplication and Squaring over GF(2m) [J]. 2015 12TH INTERNATIONAL IRANIAN SOCIETY OF CRYPTOLOGY CONFERENCE ON INFORMATION SECURITY AND CRYPTOLOGY (ISCISC), 2015, : 17 - 22
- [4] Efficient Parallel and Serial Systolic Structures for Multiplication and Squaring Over GF(2m) [J]. CANADIAN JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING-REVUE CANADIENNE DE GENIE ELECTRIQUE ET INFORMATIQUE, 2019, 42 (02): : 114 - 120
- [6] Efficient bit-parallel systolic architecture for multiplication and squaring over GF(2m) [J]. IEICE ELECTRONICS EXPRESS, 2018, 15 (02):
- [8] Fast exponentiaion over GF(2m) based on cellular automata [J]. COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS, 2003, 2658 : 841 - 850
- [9] Compact bit-parallel systolic montgomery multiplication over GF(2m) generated by trinomials [J]. TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2006, : 259 - 262
- [10] Efficient parallel semi-systolic array structure for multiplication and squaring in GF(2m) [J]. IEICE ELECTRONICS EXPRESS, 2019, 16 (12):