Zaytun: lattice based PKE and KEM with shorter ciphertext size
From MaRDI portal
Publication:6618601
Recommendations
Cites work
- A modular analysis of the Fujisaki-Okamoto transformation
- Authenticated key exchange from ideal lattices
- Better key sizes (and attacks) for LWE-based encryption
- Classical hardness of learning with errors
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Lattice cryptography for the internet
- Making NTRU as secure as worst-case problems over ideal lattices
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum key search for ternary LWE
- Secure integration of asymmetric and symmetric encryption schemes
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: Zaytun: lattice based PKE and KEM with shorter ciphertext size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618601)