Lattices are mathematical objects generalizing the concrete idea of grid embedded in the plane. They play a fundamental role in the study of various subfields of mathematics and computer science, in particular, algebraic number theory and cryptography. This thesis deals with so-called "algebraic" lattices, that is, constructed above a maximal order of a number field, with a particular emphasis on computational methods. After developing generic techniques enabling the certified manipulation of such objects, we will turn to the development of an effective algorithms for the reduction of lattices over cyclotomic fields, in particular exploiting their natural recursive and symplectic structure. This study is then used for the resolution of a central problem in algorithmic number theory, namely the principal ideal problem, consisting of the finding of a generator a principal ideal in a number field. We eventually look at the implications of these works in public-key cryptography, where we present attacks on a fully homomorphic encryption scheme and on the BLISS digital signature.