## 抄録

It is shown that public key cryptosystems based on discrete logarithm probrem can be solved if the quantum computer and Shor's algorithm are realized. Thus a new cryptosystem called post-quantum cryptosystem so as not to be broken by quantum computer is needed. NTRU is proposed by Hoffstein et al. in 1998. It is one of post-quantum cryptosystem. It is based on problems on lattice for which there are no efficient algorithms to solve. In NTRU, using convolution polynomial ring as Z_{q}[X]/(X^{n}-1). However, (X-1), that is a trivial factor of X^{n}-1 sometimes make problems. Thus we consider a variant using a quotient polynomial ring such as Z_{q}[X]/(X^{n} + X^{x-1} +^{...}+X + 1) and CVMA: Cyclic Vector Multiplication Algorithm.

本文言語 | English |
---|---|

ホスト出版物のタイトル | 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 |

出版社 | Institute of Electrical and Electronics Engineers Inc. |

ページ | 384-385 |

ページ数 | 2 |

ISBN（印刷版） | 9781479987443 |

DOI | |

出版ステータス | Published - 8月 20 2015 |

イベント | 2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 - Taipei 継続期間: 6月 6 2015 → 6月 8 2015 |

### Other

Other | 2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 |
---|---|

国/地域 | Taiwan, Province of China |

City | Taipei |

Period | 6/6/15 → 6/8/15 |

## ASJC Scopus subject areas

- 人工知能
- コンピュータ ネットワークおよび通信
- 電子工学および電気工学
- 器械工学
- メディア記述