### Abstract

Recent cryptographic applications such as elliptic curve cryptography and pairing-based cryptography often need arithmetic operations, especially vector multiplications in a certain extension field of large order. Thus, the authors have proposed cyclic vector multiplication algorithm (CVMA) with prime Gauss period normal basis (GNB) for accelerating multiplications in extension field. It is efficient for most cases; however, a few cases were not. In order to reduce the few inefficient cases without loss of the convenience of CVMA, this paper extends the idea to square-free GNB with improving CVMA.

Original language | English |
---|---|

Title of host publication | Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 |

Pages | 136-140 |

Number of pages | 5 |

Publication status | Published - Oct 8 2012 |

Event | 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 - Seoul, Korea, Republic of Duration: Apr 24 2012 → Apr 26 2012 |

### Publication series

Name | Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 |
---|---|

Volume | 1 |

### Other

Other | 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 |
---|---|

Country | Korea, Republic of |

City | Seoul |

Period | 4/24/12 → 4/26/12 |

### ASJC Scopus subject areas

- Computer Networks and Communications
- Information Systems

## Fingerprint Dive into the research topics of 'A multiplication algorithm with square-free Gauss period normal basis'. Together they form a unique fingerprint.

## Cite this

Nogami, Y., & Nekado, K. (2012). A multiplication algorithm with square-free Gauss period normal basis. In

*Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012*(pp. 136-140). [6268483] (Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012; Vol. 1).