A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Discrete Mathematics and Its Applications
Prerequisites: linear and modern algebra, elementary number theory 9.1 Theory and Models Chapter 8 has described several of the classical models of cryptography in which the decryption key was the same as or easily derivable from the encryption key. This meant that the corresponding encryption and decryption algorithms were closely related in the sense that one could be easily deduced from the other. Such cryptographic systems are called symmetric-key or conventional systems, and their securitydoi:10.1201/9781420050042.ch6 fatcat:cynowdu6wndsroli3gsy7tzhqm