Post-Quantum Cryptography: State of the Art
From MaRDI portal
Publication:2803619
DOI10.1007/978-3-662-49301-4_6zbMath1405.94002OpenAlexW2398921709MaRDI QIDQ2803619
Florian Göpfert, Albrecht Petzoldt, Denis Butin, Johannes A. 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
Quantum computation (81P68) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multivariate based threshold ring signature scheme
- Factoring polynomials with rational coefficients
- Design Principles for HFEv- Based Multivariate Signature Schemes
- Lattice Signatures and Bimodal Gaussians
- Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices
- Implementing CFS
- 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
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Faster 2-Regular Information-Set Decoding
- On the Security of the Winternitz One-Time Signature Scheme
- CyclicRainbow – A Multivariate Signature Scheme with a Partially Cyclic Public Key
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Linear Recurring Sequences for the UOV Key Generation
- BKZ 2.0: Better Lattice Security Estimates
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- McEliece Cryptosystem Implementation: Theory and Practice
- On Ideal Lattices and Learning with Errors over Rings
- Information-Set Decoding for Linear Codes over F q
- Generalized Compact Knapsacks Are Collision Resistant
- Rainbow, a New Multivariable Polynomial Signature Scheme
- SSE Implementation of Multivariate PKCs on Modern x86 CPUs
- Elliptic Curve Cryptosystems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- A Method of Factoring and the Factorization of F 7
- A method for obtaining digital signatures and public-key cryptosystems
- Unbalanced Oil and Vinegar Signature Schemes
- A new identification scheme based on syndrome decoding
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Strengths and Weaknesses of Quantum Computing
- The hardness of the closest vector problem with preprocessing
- RIPEMD-160: A strengthened version of RIPEMD
- Solving BDD by Enumeration: An Update
- Keccak
- Secure and Anonymous Hybrid Encryption from Coding Theory
- Simple Matrix Scheme for Encryption
- Lattice Decoding Attacks on Binary LWE
- Fully homomorphic encryption using ideal lattices
- Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- How to Break MD5 and Other Hash Functions
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Fast Software Encryption
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Post-Quantum Cryptography: State of the Art
