Cryptographic divergences: new techniques and new applications
From MaRDI portal
Publication:2106664
Recommendations
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Improved security evaluation techniques for imperfect randomness from arbitrary distributions
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
Cited in
(4)- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- scientific article; zbMATH DE number 7526290 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
This page was built for publication: Cryptographic divergences: new techniques and new applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106664)