We analyze the security and performance of two recently proposed encryption algorithms designed using deterministic chaotic dynamical systems. The analysis shows not only that the encryption rates of these algorithms are not competitive to the encryption rates of the standard algorithms, but that the algorithms can be easily broken using known-plaintext attack. (C) 2001 Elsevier Science B.V. All rights reserved.