Automorphism Shuffles for Graphs and Hypergraphs and Its Applications

In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes card-sequence along with some probability distribution, ensures the security protocol. The authors proposed new class shuffles called graph shuffles, by an automorphism directed (New Generation Computing 2022). For G n vertices and m edges, such shuffle could be implemented pile-scramble 2(n + m) cards. this paper, we study give implementation, application, slight generalization. First, propose protocol for 2n Second, as application show that any cyclic group over group, associated graph. Third, define hypergraph hypergraph, can also shuffles.