On the application of parameter identifiability to the security of chaotic synchronization

We apply the concept of parameter identifiability to the security of parameters in chaos-based communication. The parameter is a good choice of the secret key if it is not identifiable. To test the parameter identifiability, we use the linear algebraic method based on differential 1-forms, which is applicable to more general systems than existing results. We analyze the identifiability of a chaotic system to illustrate this method. Finally, we use this chaotic system to construct two cryptosystems.