Post-quantum cryptography: state of the art

DOI10.1007/978-3-662-49301-4_6MaRDI QIDQ2803619zbMATH OpenOpenAlexFDO

Authors Denis Butin, Florian Göpfert, Albrecht Petzoldt, Johannes Buchmann

Publication date 2 May 2016

Published in The New Codebreakers (Search for Journal in Brave)

Full work available at URL https://zenodo.org/record/845312

zbMATH Keywords

public-key cryptographyquantum computingpost-quantum cryptography

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Post-quantum primitives in information security
• A panorama of post-quantum cryptography
• The challenge of quantum computing to information security and our countermeasures
• Introduction to post-quantum cryptography
• Post-quantum cryptography: lattice signatures

Cites work

• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• scientific article; zbMATH DE number 3959521 (Why is no real title available?)
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 475432 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• scientific article; zbMATH DE number 1978496 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• A Method of Factoring and the Factorization of F 7
• A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
• A method for obtaining digital signatures and public-key cryptosystems
• A multivariate based threshold ring signature scheme
• A new identification scheme based on syndrome decoding
• A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An improved compression technique for signatures based on learning with errors
• BKZ 2.0: Better lattice security estimates
• Better key sizes (and attacks) for LWE-based encryption
• CyclicRainbow – A Multivariate Signature Scheme with a Partially Cyclic Public Key
• Design Principles for HFEv- Based Multivariate Signature Schemes
• Elliptic Curve Cryptosystems
• Factoring polynomials with rational coefficients
• Fast Software Encryption
• Faster 2-regular information-set decoding
• Fully homomorphic encryption using ideal lattices
• Generalized Compact Knapsacks Are Collision Resistant
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to Break MD5 and Other Hash Functions
• Implementing CFS
• Information-set decoding for linear codes over \(\mathbb F_q\)
• Keccak
• Lattice decoding attacks on binary LWE
• Lattice signatures and bimodal Gaussians
• Linear recurring sequences for the UOV key generation
• Making NTRU as secure as worst-case problems over ideal lattices
• McEliece Cryptosystem Implementation: Theory and Practice
• New directions in cryptography
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the security of the Winternitz one-time signature scheme
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
• RIPEMD-160: a strengthened version of RIPEMD
• Rainbow, a New Multivariable Polynomial Signature Scheme
• SSE Implementation of Multivariate PKCs on Modern x86 CPUs
• Secure and anonymous hybrid encryption from coding theory
• Simple matrix scheme for encryption
• Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices
• Solving BDD by enumeration: an update
• Strengths and Weaknesses of Quantum Computing
• The hardness of the closest vector problem with preprocessing
• Unbalanced Oil and Vinegar Signature Schemes
• XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions

Cited in

(12)

• Patent landscape in the field of hash-based post-quantum signatures (invited paper)
• The challenge of quantum computing to information security and our countermeasures
• Post-quantum key exchange for the Internet and the open quantum safe project
• Post-quantum primitives in information security
• Sustainable cryptography
• Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
• Preventing the quantum crypto-apocalypse with linear algebra with errors
• Introduction to post-quantum cryptography
• Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security
• New mission and opportunity for mathematics researchers: cryptography in the quantum era
• Quantum-assisted QD-CFS signatures
• A panorama of post-quantum cryptography

Describes a project that uses

Uses Software

• McEliece
• BLISS
• CFS
• Keccak
• BKZ
• NTRU

This page was built for publication: Post-quantum cryptography: state of the art

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803619)