Efficient implimentation of NTRU over all one polynomial ring with CVMA

Koki Misumi; Yasuyuki Nogami

doi:10.1109/ICCE-TW.2015.7216956

Efficient implimentation of NTRU over all one polynomial ring with CVMA

研究成果

抄録

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ⁿ-1). However, (X-1), that is a trivial factor of Xⁿ-1 sometimes make problems. Thus we consider a variant using a quotient polynomial ring such as Z_q[X]/(Xⁿ + 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	https://doi.org/10.1109/ICCE-TW.2015.7216956
出版ステータス	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

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

文献へのアクセス

10.1109/ICCE-TW.2015.7216956

他のファイルとリンク

引用スタイル

Misumi, K & Nogami, Y 2015, Efficient implimentation of NTRU over all one polynomial ring with CVMA. in 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015., 7216956, Institute of Electrical and Electronics Engineers Inc., pp. 384-385, 2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015, Taipei, Taiwan, Province of China, 6/6/15. https://doi.org/10.1109/ICCE-TW.2015.7216956

@inproceedings{d6caf3a28a4a468bbf04e47bcedf68ac,

title = "Efficient implimentation of NTRU over all one polynomial ring with CVMA",

abstract = "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 Zq[X]/(Xn-1). However, (X-1), that is a trivial factor of Xn-1 sometimes make problems. Thus we consider a variant using a quotient polynomial ring such as Zq[X]/(Xn + Xx-1 +...+X + 1) and CVMA: Cyclic Vector Multiplication Algorithm.",

keywords = "Bismuth",

author = "Koki Misumi and Yasuyuki Nogami",

year = "2015",

month = aug,

day = "20",

doi = "10.1109/ICCE-TW.2015.7216956",

language = "English",

isbn = "9781479987443",

pages = "384--385",

booktitle = "2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 ; Conference date: 06-06-2015 Through 08-06-2015",

}

TY - GEN

T1 - Efficient implimentation of NTRU over all one polynomial ring with CVMA

AU - Misumi, Koki

AU - Nogami, Yasuyuki

PY - 2015/8/20

Y1 - 2015/8/20

N2 - 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 Zq[X]/(Xn-1). However, (X-1), that is a trivial factor of Xn-1 sometimes make problems. Thus we consider a variant using a quotient polynomial ring such as Zq[X]/(Xn + Xx-1 +...+X + 1) and CVMA: Cyclic Vector Multiplication Algorithm.

AB - 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 Zq[X]/(Xn-1). However, (X-1), that is a trivial factor of Xn-1 sometimes make problems. Thus we consider a variant using a quotient polynomial ring such as Zq[X]/(Xn + Xx-1 +...+X + 1) and CVMA: Cyclic Vector Multiplication Algorithm.

KW - Bismuth

UR - http://www.scopus.com/inward/record.url?scp=84959543294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959543294&partnerID=8YFLogxK

U2 - 10.1109/ICCE-TW.2015.7216956

DO - 10.1109/ICCE-TW.2015.7216956

M3 - Conference contribution

AN - SCOPUS:84959543294

SN - 9781479987443

SP - 384

EP - 385

BT - 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 6 June 2015 through 8 June 2015

ER -

Efficient implimentation of NTRU over all one polynomial ring with CVMA

抄録

Other

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル