**Abstract** : A quadrature is an approximation of the definite integral of a function by a weighted sum of function values at specified points, or nodes, within the domain of integration. Gaussian quadratures are constructed to yield exact results for any polynomial of degree 2r − 1 or less by a suitable choice of r nodes and weights. Cubature is a generalization of quadrature in higher dimension. Constructing a cubature amounts to find a linear form Λ : R[x] → R, p → r j=1 a j p(ξ j) from the knowledge of its restriction to R[x] ≤d. The unknowns are the number of nodes r, the weights a j and the nodes ξ j. An approach based on moment matrices was proposed in [25]. We give a basis-free version in terms of the Hankel operator H associated to Λ. The existence of a cubature of degree d with r nodes boils down to conditions of ranks and positive semidefiniteness on H. We then recognize the nodes as the solutions of a generalized eigenvalue problem. Standard domains of integration are symmetric under the action of a finite group. It is natural to look for cubatures that respect this symmetry [13, 27, 28]. Introducing adapted bases obtained from representation theory, the symmetry constraint allows to block diago-nalize the Hankel operator H. We then deal with smaller-sized matrices both for securing the existence of the cubature and computing the nodes. The sizes of the blocks are furthermore explicitly related to the orbit types of the nodes with the new concept of the matrix of multiplicities of a finite group. It provides preliminary criteria of existence of a cubature with a given organisation of the nodes in orbit types. The Maple implementation of the presented algorithms allows to determine, with moderate computational efforts, all the symmetric cubatures of a given degree. We present new relevant cubatures.