Report on Post-Quantum Cryptography
Lidong Chen,Stephen P. Jordan,Yi-Kai Liu,Dustin Moody,René Peralta,Ray A. Perlner,Daniel Smith-Tone +6 more
- 28 Apr 2016
TL;DR: The National Institute of Standards and Technology (NIST)'s current understanding about the status of quantum computing and post-quantum cryptography is shared, and NIST’s initial plan to move forward is outlined.
read more
Abstract: In recent years, there has been a substantial amount of research on quantum computers – machines that exploit quantum mechanical phenomena to solve mathematical problems that are difficult or intractable for conventional computers. If large-scale quantum computers are ever built, they will be able to break many of the public-key cryptosystems currently in use. This would seriously compromise the confidentiality and integrity of digital communications on the Internet and elsewhere. The goal of post-quantum cryptography (also called quantum-resistant cryptography) is to develop cryptographic systems that are secure against both quantum and classical computers, and can interoperate with existing communications protocols and networks. This Internal Report shares the National Institute of Standards and Technology (NIST)’s current understanding about the status of quantum computing and post-quantum cryptography, and outlines NIST’s initial plan to move forward in this space. The report also recognizes the challenge of moving to new cryptographic infrastructures and therefore emphasizes the need for agencies to focus on crypto agility.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Blockchain Technology Overview
Dylan J. Yaga,Peter Mell,Nik Roby,Karen A. Scarfone +3 more
- 24 Jan 2018
TL;DR: A high-level technical overview of blockchain technology can be found in this article, where the authors provide an overview of how blockchain technology works and how a community of users can record transactions in a shared ledger within that community.
What should 6G be
Shuping Dang,Osama Amin,Basem Shihada,Mohamed-Slim Alouini +3 more
- 24 Jan 2020
TL;DR: It is suggested that human-centric mobile communications will still be the most important application of 6G and the 6G network should be human centric and high security, secrecy and privacy are its key features.
1K
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Joppe W. Bos,Léo Ducas,Eike Kiltz,Tancrède Lepoint,Vadim Lyubashevsky,John M. Schanck,Peter Schwabe,Gregor Seiler,Damien Stehlé +8 more
- 24 Apr 2018
TL;DR: This paper introduces Kyber, a portfolio of post-quantum cryptographic primitives built around a key-encapsulation mechanism (KEM), based on hardness assumptions over module lattices, and introduces a CPA-secure public-key encryption scheme and eventually construct, in a black-box manner, CCA-secure encryption, key exchange, and authenticated-key-exchange schemes.
A Survey of Blockchain Technology Applied to Smart Cities: Research Issues and Challenges
TL;DR: A comprehensive survey on the literature involving blockchain technology applied to smart cities, from the perspectives of smart citizen, smart healthcare, smart grid, smart transportation, supply chain management, and others is provided.
739
The Road Towards 6G: A Comprehensive Survey
TL;DR: In this article, the authors provide a comprehensive survey to draw a picture of the 6G system in terms of drivers, use cases, usage scenarios, requirements, key performance indicators (KPIs), architecture, and enabling technologies.
733
References
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
7.5K
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for both problems, which takes a number of steps polynomial in the input size, e.g., the number of digits to be factored.
5.9K
Superconducting quantum circuits at the surface code threshold for fault tolerance
Rami Barends,Julian Kelly,A. Megrant,Andrzej Veitia,Daniel Sank,Evan Jeffrey,Ted White,Josh Mutus,Austin G. Fowler,Brooks Campbell,Yu Chen,Zijun Chen,Benjamin Chiaro,Andrew Dunsworth,Charles Neill,Peter O'Malley,Pedram Roushan,Amit Vainsencher,James Wenner,Alexander N. Korotkov,Andrew Cleland,John M. Martinis +21 more
TL;DR: The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
Strengths and Weaknesses of Quantum Computing
TL;DR: It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$.
1.5K