A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\em cylindrical crossing number} of a graph \(G\) is the minimum number of crossings in a cylindrical drawing of \(G\). In his influential survey on the variants of the definition of the crossing number of a graph, Schaefer lists the complexity of computing the cylindrical crossing number of a graph as an open question. In this paper we settle this by showing that this problem is NP-complete. Moreover, we show an analogous result for the natural generalization of the cylindrical crossing number, namely the \(t\)-{\em circle crossing number}.