The existence question for a - design is open, In this paper, we examine possible automorphisms of this design. We consider a minimum subset of basic permutations consisting of cycles of prime length and prove that if a - design exists, then it is either rigid or admits basic automorphisms with cycles of length or .