1.7.6 Cryptography
INPUT OUTPUT
Input Description:
A plaintext message
T
or encrypted text
E
, and a key
k
.
Problem:
Encode
T
using
k
giving
E
, or decode
E
using
k
back to
T
.
Implementations
() (rating 10)
The Stanford GraphBase (C) (rating 3)
Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 3)
Related Problems
Factoring and Primality Testing
Arbitrary Precision Arithmetic
Text Compression
Go to the corresponding chapter in the book
About the Book
Send us Mail
Go to Main Page
This page last modified on Tue Jun 03, 1997
.