Organizer: Prof. Johannes Buchmann, Moritz Horsch
Some recent cryptographic schemes rely on the hardness of finding a shortest generator of a principal (fractional) ideal in an algebraic number field K in the logarithmic embedding with some guaranteed small generator. Cramer, Ducas Peikert and Regev have shown that one can efficiently recover short generators in cyclotomic fields of prime power conductor with quantum computers. In my thesis I generalized their results to the case, that m is the product of two prime powers. Hence, one can efficiently recover short generators under some conditions in this case.