In this paper, we propose an efficient aggregation scheme that considers the cyclic connection pattern between users and relays in hierarchical secure aggregation (HSA). While existing HSA studies assume that each user is connected to only one relay, in this paper, we propose a scheme where each user is cyclically connected to B consecutive relays. To this end, we present an efficient aggregation scheme that includes a message design inspired by gradient coding and a complex secure key design, and we derive a new inverse theorem for minimum communication and key rate using information-theoretic arguments. The core of the research is to improve the efficiency of communication and key generation by applying the gradient coding technique for efficient communication in distributed computing to HSA.