May, 2005
Fast implementation of extension fields with TypeII ONB and cyclic vector multiplication algorithm
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- ,
- ,
- Volume
- E88A
- Number
- 5
- First page
- 1200
- Last page
- 1208
- Language
- English
- Publishing type
- DOI
- 10.1093/ietfec/e88-a.5.1200
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
This paper proposes an extension field named TypeII AOPF. This extension field adopts TypeII optimal normal basis, cyclic vector multiplication algorithm, and Itoh-Tsujii inversion algorithm. The calculation costs for a multiplication and inversion in this field is clearly given with the extension degree. For example, the arithmetic operations in TypeII AOPF F-p5 is about 20% faster than those in OEF F-p5. Then, since CVMA is suitable for parallel processing, we show that TypeII AOPF is superior to AOPF as to parallel processing and then show that a multiplication in TypeII AOPF becomes about twice faster by parallelizing the CVMA computation in TypeII AOPF.
- Link information
-
- DOI
- https://doi.org/10.1093/ietfec/e88-a.5.1200
- DBLP
- https://dblp.uni-trier.de/rec/journals/ieicet/NogamiSM05
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000229253400015&DestApp=WOS_CPL
- URL
- https://dblp.uni-trier.de/db/journals/ieicet/ieicet88a.html#NogamiSM05
- ID information
-
- DOI : 10.1093/ietfec/e88-a.5.1200
- ISSN : 1745-1337
- DBLP ID : journals/ieicet/NogamiSM05
- Web of Science ID : WOS:000229253400015