In [8], it is shown that the complete multipartite graph $K_{n(2t)}$ having n partite sets of size 2t, where $n{geq}6;and;t{geq}1$, has a decomposition into gregarious 6-cycles if $n{equiv}0,1,3$ or 4 (mod 6). Here, a cycle is called gregarious if it has at most one vertex from any particular partite set. In this paper, when $n{equiv}0$ or 3 (mod 6), another method using difference set is presented. Furthermore, when $n{equiv}0$ (mod 6), the decomposition obtained in this paper is ${infty}-circular$, in the sense that it is invariant under the mapping which keeps the partite set which is indexed by ${infty}$ fixed and permutes the remaining partite sets cyclically.