Applications of Abstract Algebra with Maple and MATLAB, Second Edition
Eliminating the need for heavy number-crunching, sophisticated mathematical software packages open the door to areas like cryptography, coding theory, and combinatorics that are dependent on abstract algebra. Applications of Abstract Algebra with Maple and MATLAB®, Second Edition explores these topics and shows how to apply the software programs to abstract algebra and its related fields.
Carefully integrating MapleTM and MATLAB®, this book provides an in-depth introduction to real-world abstract algebraic problems. The first chapter offers a concise and comprehensive review of prerequisite advanced mathematics. The next several chapters examine block designs, coding theory, and cryptography while the final chapters cover counting techniques, including Pólya's and Burnside's theorems. Other topics discussed include the Rivest, Shamir, and Adleman (RSA) cryptosystem, digital signatures, primes for security, and elliptic curve cryptosystems.
New to the Second Edition
With the incorporation of MATLAB, this second edition further illuminates the topics discussed by eliminating extensive computations of abstract algebraic techniques. The clear organization of the book as well as the inclusion of two of the most respected mathematical software packages available make the book a useful tool for students, mathematicians, and computer scientists.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Error Correcting Codes
The RSA Cryptosystem
Elliptic Curve Cryptography
Other editions - View all
AES encryption process affine cipher BCH code beads block design CD-ROM Chapter ciphertext codewords coefficients colleague column complete summary compute construct contains convert cosets crcpress ctext cycle index cycles of length decrypt the ciphertext determine downloaded at www.crcpress.com/e_products/downloads/download.asp?cat_no=C6102 encrypt the message encryption exponent entering the following error correction Euclidean algorithm field elements finite field found in Appendix group G Hadamard matrix Hamming code Hill cipher included index of coincidence initial key initial round input parameter insecure line intruder key matrix keyword linear code loop M-file Maple session maple('modp MATLAB MATLAB session modulo necklace nonzero elements ordered pairs output partition pattern inventory permutation plaintext positive integer preceding command prime primitive polynomial ptext Reed-Muller code RSA cryptosystem S-box session and saved shift cipher Suppose Theorem undirected graphs user-written function variable vertices Vigenere cipher write a complete written separately