Tests de primalité d'après Adleman, Rumely, Pomerance et Lenstra
This paper contains an overview of the known cases of the Bloch-Kato conjecture. It does not attempt to overview the known cases of the Beilinson conjecture and also excludes the Birch and Swinnerton-Dyer point. The paper starts with a brief review of the formulation of the general conjecture. The final part gives a brief sketch of the proofs in the known cases.
We describe practical algorithms from computational algebraic number theory, with applications to class field theory. These include basic arithmetic, approximation and uniformizers, discrete logarithms and computation of class fields. All algorithms have been implemented in the Pari/Gp system.