Post-Quantum Cryptography
From MaRDI portal
Publication:3532979
DOI10.1007/978-3-540-88702-7zbMATH Open1155.81007OpenAlexW4297991408MaRDI QIDQ3532979FDOQ3532979
Authors:
Publication date: 29 October 2008
Full work available at URL: https://doi.org/10.1007/978-3-540-88702-7
Quantum computation (81P68) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to quantum theory (81-06)
Cited In (43)
- An LWE-based verifiable threshold secret sharing scheme
- SoK: how (not) to design and implement post-quantum cryptography
- Lattices from abelian extensions and error-correcting codes
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- A multivariate encryption scheme with Rainbow
- An improved quantum algorithm for the quantum learning with errors problem
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
- Survey of lattice-based group signature
- Efficient key recovery for all HFE signature variants
- A key recovery attack on MDPC with CCA security using decoding errors
- Efficient key generation for Rainbow
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- Computational problems in supersingular elliptic curve isogenies
- Controlled quantum secure direct communication by entanglement distillation or generalized measurement
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- A multivariate quadratic challenge toward post-quantum generation cryptography
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Revisiting the efficient key generation of ZHFE
- Cube-root-subgroups of \(\operatorname{SL}_2\) over imaginary quadratic integers
- Optimum commutative group codes
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
- Cryptanalysis of Riccati equation encryption schemes TP-I and TP-II
- On the geometry of cyclic lattices
- A security analysis of uniformly-layered Rainbow defined over non-commutative rings
- Title not available (Why is that?)
- On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
- Efficient public-key operation in multivariate schemes
- General linear group action on tensors: a candidate for post-quantum cryptography
- Reducing the key size of rainbow using non-commutative rings
- Quantum cryptography beyond quantum key distribution
- Cryptanalysis of the CLR-cryptosystem
- On the Berger-Loidreau cryptosystem on the tensor product of codes
- On the equivalence of two post-quantum cryptographic families
- An estimator for the hardness of the MQ problem
- Secure two-party computation in a quantum world
- Title not available (Why is that?)
- A multivariate based threshold ring signature scheme
- A study on randomness used in signature generation of UOV
- Authenticated communication from quantum readout of pufs
- A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials
- Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
This page was built for publication: Post-Quantum Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532979)
