On symmetric encryption with distinguishable decryption failures
From MaRDI portal
(Redirected from Publication:2946887)
Recommendations
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - CRYPTO 2003
- Authenticated-encryption with padding: a formal security treatment
- Breaking and provably repairing the SSH authenticated encryption scheme
- Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field
- Elliptic Curve Cryptosystems
- Fast Software Encryption
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1302781 (Why is no real title available?)
- scientific article; zbMATH DE number 1302834 (Why is no real title available?)
- scientific article; zbMATH DE number 2034310 (Why is no real title available?)
- scientific article; zbMATH DE number 2086707 (Why is no real title available?)
- scientific article; zbMATH DE number 2086729 (Why is no real title available?)
- scientific article; zbMATH DE number 1842499 (Why is no real title available?)
- scientific article; zbMATH DE number 1848307 (Why is no real title available?)
- scientific article; zbMATH DE number 1406771 (Why is no real title available?)
- scientific article; zbMATH DE number 1424183 (Why is no real title available?)
- Modular Multiplication Without Trial Division
- Monte Carlo Methods for Index Computation (mod p)
- On symmetric encryption with distinguishable decryption failures
- On the broadcast and validity-checking security of \textsc{pkcs}\#1 v1.5 encryption
- Plaintext-dependent decryption: a formal security treatment of SSH-CTR
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Speeding up bipartite modular multiplication
- Tag size does matter: attacks and proofs for the TLS record protocol
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(14)- Hidden shift quantum cryptanalysis and implications
- Simulatable channels: extended security that is universally composable and easier to prove
- Partition oracles from weak key forgeries
- A message franking channel
- Security of symmetric encryption in the presence of ciphertext fragmentation
- On symmetric encryption with distinguishable decryption failures
- Rogue Decryption Failures: Reconciling AE Robustness Notions
- RIV for robust authenticated encryption
- Verifiable side-channel security of cryptographic implementations: constant-time MEE-CBC
- Advances in Cryptology - CRYPTO 2003
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Overloading the nonce: rugged PRPs, nonce-set AEAD, and order-resilient channels
- Failing gracefully: decryption failures and the Fujisaki-Okamoto transform
- Comprehensive robustness analysis of GCM, CCM, and OCB3
This page was built for publication: On symmetric encryption with distinguishable decryption failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946887)
