Recent developments in post-quantum cryptography

Tsuyoshi Takagi

Research output: Contribution to journalArticle

Abstract

The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.

Original languageEnglish
Pages (from-to)3-11
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE101A
Issue number1
DOIs
Publication statusPublished - Jan 1 2018

Fingerprint

Quantum Cryptography
Quantum cryptography
Cryptography
Quantum computers
Quantum Computer
Cryptosystem
Polynomials
Discrete Logarithm Problem
Public-key Cryptosystem
Multivariate Polynomials
Factoring
Vulnerability
Hardness
Polynomial time
Integer
Alternatives

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Recent developments in post-quantum cryptography. / Takagi, Tsuyoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E101A, No. 1, 01.01.2018, p. 3-11.

Research output: Contribution to journalArticle

@article{90a0f8afcdfa428893c5afdcabd605ec,
title = "Recent developments in post-quantum cryptography",
abstract = "The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.",
author = "Tsuyoshi Takagi",
year = "2018",
month = "1",
day = "1",
doi = "10.1587/transfun.E101.A.3",
language = "English",
volume = "E101A",
pages = "3--11",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - Recent developments in post-quantum cryptography

AU - Takagi, Tsuyoshi

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.

AB - The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.

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

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

U2 - 10.1587/transfun.E101.A.3

DO - 10.1587/transfun.E101.A.3

M3 - Article

AN - SCOPUS:85040189013

VL - E101A

SP - 3

EP - 11

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -