Cryptography and Network Security (4th Edition)

[Page 129 (continued)]

4.7. Recommended Reading and Web Sites

[HERS75], still in print, is the classic treatment of abstract algebra; it is readable and rigorous; [DESK92] is another good resource. [KNUT98] provides good coverage of polynomial arithmetic.

[Page 130]

One of the best treatments of the topics of this chapter is [BERL84], still in print. [GARR01] also has extensive coverage. A thorough and rigorous treatment of finite fields is [LIDL94]. [HORO71] is a good overview of the topics of this chapter.

BERL84 Berlekamp, E. Algebraic Coding Theory. Laguna Hills, CA: Aegean Park Press, 1984.

DESK92 Deskins, W. Abstract Algebra. New York: Dover, 1992.

GARR01 Garrett, P. Making, Breaking Codes: An Introduction to Cryptology. Upper Saddle River, NJ: Prentice Hall, 2001.

HERS75 Herstein, I. Topics in Algebra. New York: Wiley, 1975.

HORO71 Horowitz, E. "Modular Arithmetic and Finite Field Theory: A Tutorial." Proceedings of the Second ACM Symposium and Symbolic and Algebraic Manipulation, March 1971.

KNUT98 Knuth, D. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1998.

LIDL94 Lidl, R., and Niederreiter, H. Introduction to Finite Fields and Their Applications. Cambridge: Cambridge University Press, 1994.

Recommended Web Sites

  • PascGalois Project: Contains a clever set of examples and projects to aid in giving students a visual understanding of key concepts in abstract algebra

Related

Категории