Post-quantum key exchange for the Internet and the open quantum safe project
From MaRDI portal
Publication:1698609
DOI10.1007/978-3-319-69453-5_2zbMath1412.94213OpenAlexW2767399671MaRDI QIDQ1698609
Douglas Stebila, Michele Mosca
Publication date: 16 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-69453-5_2
Related Items (10)
Benchmarking Post-quantum Cryptography in TLS ⋮ Towards post-quantum security for signal's X3DH handshake ⋮ Implementing and measuring \textsf{KEMTLS} ⋮ More efficient post-quantum KEMTLS with pre-distributed public keys ⋮ QUIC protocol with post-quantum authentication ⋮ A performance evaluation of IPsec with post-quantum cryptography ⋮ HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption ⋮ liboqs ⋮ KEMTLS with delayed forward identity protection in (almost) a single round trip ⋮ Security comparisons and performance analyses of post-quantum signature algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- On the concrete hardness of learning with errors
- Sieving for shortest vectors in ideal lattices: a practical perspective
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- A Decade of Lattice Cryptography
- How (Not) to Instantiate Ring-LWE
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- McBits: Fast Constant-Time Code-Based Cryptography
- On the Security of TLS-DHE in the Standard Model
- Lattice Cryptography for the Internet
- SPHINCS: Practical Stateless Hash-Based Signatures
- Authenticated Key Exchange from Ideal Lattices
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- On Ideal Lattices and Learning with Errors over Rings
- Some Recent Progress in Lattice-Based Cryptography
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- A Toolkit for Ring-LWE Cryptography
- Sieving for Shortest Vectors in Ideal Lattices
- Signatures Through Approximate Representations by Quadratic Forms
- Short Stickelberger Class Relations and Application to Ideal-SVP
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Post-quantum key exchange for the Internet and the open quantum safe project
