On the security of cryptosystems with all-or-nothing transform
From MaRDI portal
Recommendations
Cited in
(15)- \textsf{Transform} without \textsf{encode} is not sufficient for SIFA and FTA security: a case study
- On security properties of all-or-nothing transforms
- Linear \((2, p, p)\)-AONTs exist for all primes \(p\)
- Towards a theory of data entanglement
- REACT: Rapid enhanced-security asymmetric cryptosystem transform
- On perfect and adaptive security in exposure-resilient cryptography
- A first study of improving transposition cryptosystem
- Exposure-resilient functions and all-or-nothing transforms
- The security of all-or-nothing encryption: Protecting against exhaustive key search
- On the security properties of OAEP as an all-or-nothing transform
- scientific article; zbMATH DE number 7528028 (Why is no real title available?)
- Coding and Cryptography
- Something about all or nothing (transforms)
- Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms
- All or nothing at all
This page was built for publication: On the security of cryptosystems with all-or-nothing transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680972)