Source: http://www-spires.fnal.gov/spires/find/books/www?keyword=%22Data+encryption+Computer+science%22
Timestamp: 2019-04-26 01:42:04+00:00

Document:
NP-Completeness -- §5. Promise Problems -- §6. Randomized Algorithms and Complexity Classes -- §7. Some Other Complexity Classes -- 3. Algebra -- §1. Fields -- §2. Finite Fields -- §3. The Euclidean Algorithm for Polynomials -- §4.
Polynomial Rings -- §5. Gröbner Bases -- 4. Hidden Monomial Cryptosystems -- § 1. The Imai-Matsumoto System -- §2. Patarin’s Little Dragon -- §3. Systems That Might Be More Secure -- 5. Combinatorial-Algebraic Cryptosystems -- §1.
History -- §2. Irrelevance of Brassard’s Theorem -- §3. Concrete Combinatorial-Algebraic Systems -- §4. The Basic Computational Algebra Problem -- §5. Cryptographic Version of Ideal Membership -- §6. Linear Algebra Attacks -- §7.
and Poles -- §4. Divisors -- §5. Representing Semi-Reduced Divisors -- §6. Reduced Divisors -- §7. Adding Reduced Divisors -- Exercises -- Answers to Exercises.

References: §5
 §6
 §7
 §1
 §2
 §3
 §4
 §5
 § 1
 §2
 §3
 §1
 §2
 §3
 §4
 §5
 §6
 §7
 §4
 §5
 §6
 §7