We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. A program based on this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.