Efficient implimentation of NTRU over all one polynomial ring with CVMA

Koki Misumi, Yasuyuki Nogami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publication2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages384-385
Number of pages2
ISBN (Print)9781479987443
DOIs
Publication statusPublished - Aug 20 2015
Event2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 - Taipei, Taiwan, Province of China
Duration: Jun 6 2015Jun 8 2015

Other

Other2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015
CountryTaiwan, Province of China
CityTaipei
Period6/6/156/8/15

Fingerprint

Cryptography
polynomials
quantum computers
Polynomials
Quantum computers
rings
quotients
logarithms
convolution integrals
multiplication
Convolution

Keywords

  • Bismuth

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Instrumentation
  • Media Technology

Cite this

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 (pp. 384-385). [7216956] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCE-TW.2015.7216956

Efficient implimentation of NTRU over all one polynomial ring with CVMA. / Misumi, Koki; Nogami, Yasuyuki.

2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 384-385 7216956.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Misumi K, Nogami Y. Efficient implimentation of NTRU over all one polynomial ring with CVMA. In 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 384-385. 7216956 https://doi.org/10.1109/ICCE-TW.2015.7216956
Misumi, Koki ; Nogami, Yasuyuki. / Efficient implimentation of NTRU over all one polynomial ring with CVMA. 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 384-385
@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 = "8",
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.",

}

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.

ER -