Feigenbaum encryption of messages

To avoid many of the problems of symmetric-key encryption, public key encryption was proposed by Hellman and Diffe (1976). The author discusses the Feigenbaum algorithm. Felgenbaum was the first person to analyse and explain chaotic behavior in cryptography using renormalization group theory. The author also clarifies some of the implications of Feigenbaum algorithm, and develops an error analysis to help one understand the encryption security involved.