Let (Q,.) be a finite quasigroup, i.e. a finite set Q with a binary operation. called multiplication such that in the equation x.y = z any two elements determine the third uniquely. Then the mappings R(x): Q → Q; q ↦ q.x and L(x): Q → Q; q ↦ x.q are permutations of Q. The multiplication group G of Q is the subgroup of the symmetric group on Q generated by {R(x), L(x) | x ∈ Q}. If S is a field, G has a faithful representation Ḡ by permutation matrices acting on the S-vector space with Q as basis. The set of matrices commuting with Ḡ forms an S-algebra (under the usual operations) called the centraliser ring V(G, Q) of G on Q. The purpose of this note is to show how the permutation-theoretic object ‘centraliser ring’ may be expressed in terms of the quasigroup structure of Q, both to prepare one tool for the long-term programme of classifying finite quasigroups by means of their multiplication groups, and for comparison with the Schur ring method of group theory.