Observations on the application of error correcting codes to public key encryption

With the breaking of the iterated Knapsack algorithm and the realization that the modular arithmetic required by the RSA algorithm causes it to operate slowly, the need for a strong, high speed public key algorithm has increased. The author draws attention to a high speed coding based algorithm. He briefly describes the algorithm in its original form, and then discusses some additional capabilities. These capabilities include the ability to simultaneously correct communication channel errors and to transmit secondary messages.<>