All-or-Nothing Transforms Using Quasigroups

In this paper we suggest a new transformation scheme for All-Or-Nothing encryption, originally suggested by Rivest. The new transform concerns the use of quasigroups for the preprocessing of the data before any ordinary encryption method. We describe a method of constructing random quasigroups and we propose a way of using the advantages of quasigroup in Rivest's method. This combination makes the method faster and maintains the advantages against brute-force attacks.