Modular Arithmetic and Elementary Algebra Lecturer : Michel Goemans

Abstract

These notes cover basic notions in algebra which will be needed for discussing several topics of this course. In particular, we will need them to describe the RSA cryptosystem, the primality testing algorithms, and for the material on error-correcting codes that we will be covering later in this course. Euclid's algorithm (or the Euclidean algorithm) is a… (More)

Topics

Cite this paper

@inproceedings{GoemansModularAA, title={Modular Arithmetic and Elementary Algebra Lecturer : Michel Goemans}, author={Michel X. Goemans} }