We show for the first time how to implement cryptographic protocols based on class groups of algebraic number fields of degree > 2. We describe how the involved objects can be represented and how the arithmetic in class groups can be realized efficiently. To speed up the arithmetic we present our new method for multiplication of ideals. Furthermore we show how to generate cryptographically suitable algebraic number fields. Besides, we give a numerical example and analyse our run times.