Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 151. Chapters: Finite fields, Modular arithmetic, Cyclic redundancy check, Euler's totient function, Fermat's little theorem, Chinese remainder theorem, Euler's theorem, Elliptic curve cryptography, Carmichael number, Linear congruence theorem, Congruence relation, Proofs of Fermat's little theorem, Linear congruential generator, Quadratic reciprocity, Legendre symbol, BCH code, Lenstra elliptic curve factorization, Fermat primality test, Nimber, Euler's criterion, Jacobi symbol, Weil conjectures, Computation of CRC, Quadratic residue, Quartic reciprocity, XTR, Cubic reciprocity, Cyclic code, Trigonometry in Galois fields, Schoof's algorithm, Primitive root modulo n, Mathematics of CRC, Modular representation theory, Gauss's lemma, Field with one element, Miller-Rabin primality test, Linear code, Finite field arithmetic, Hidden Field Equations, Multiplicative group of integers modulo n, Rijndael mix columns, Network coding, Verhoeff algorithm, Cipolla's algorithm, Montgomery reduction, Modular exponentiation, Root of unity modulo n, AKS primality test, Frobenius endomorphism, Rijndael S-box, Tonelli-Shanks algorithm, Drinfel'd module, Wilson's theorem, Solovay-Strassen primality test, Sato-Tate conjecture, Zeller's congruence, Luhn algorithm, Luhn mod N algorithm, Conway polynomial, Galois/Counter Mode, Hensel's lemma, Diffie-Hellman problem, Carmichael function, Dowling geometry, Discrete logarithm, Kochanski multiplication, Local zeta-function, Cantor-Zassenhaus algorithm, Berlekamp's algorithm, Pocklington's algorithm, Discrete logarithm records, Table of costs of operations in elliptic curves, Hasse-Witt matrix, Chevalley-Warning theorem, Goppa code, Residue number system, Lehmer random number generator, Modular multiplicative inverse, Zech's logarithms, CMAC, Additive polynomial, Chien search, Ternary Golay code, Beaver bit-...