A new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations. The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets. Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method. However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with. It would be interesting to derive new strategy by fixing an element in any position. A new method is developed for starter sets generation namely STARSET1 based on circular where any element can be selected randomly to be fixed. The result showed that no redundancy of starter sets is occurring and no equivalence starter sets are obtained.