Something About All or Nothing (Transforms)
- D. R. Stinson
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Inthis short note, we study all-or-nothing transforms, which wererecently proposed by Rivest as a mode of operation for blockciphers. We study transforms of this type that provide unconditionalsecurity. A simple construction for linear transforms is given,and some existence and non-existence results for general transformsare derived from a combinatorial characterization of these objects.
- J. Bierbrauer, Private communication, January 13, 1999.
- R. C. Bose, S. S. Shrikhande and E. T. Parker, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture, Canad. J. Math., Vol. 12 (1960) pp. 189–203.
- C. J. Colbourn and J. H. Dinitz, eds., The CRC Handbook of Combinatorial Designs, CRC Press (1996).
- F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland (1977).
- A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press (1996).
- R. L. Rivest, All-or-nothing encryption and the package transform, In Fast Software Encryption 1997, (E. Biham, ed.), Lecture Notes in Computer Science, 1267 (1997) pp. 210–218.
- Something About All or Nothing (Transforms)
Designs, Codes and Cryptography
Volume 22, Issue 2 , pp 133-138
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors
- D. R. Stinson (1)
- Author Affiliations
- 1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo Onatrio, N2L 3G1, Canada