I study chaos-based communication systems and one of their main advantages stated in the literature is that they are "secure". But I haven't found any mathematical proof of this affirmation in any sense so far.
I'm sorry Márcio but I don't any rigorous approach. I'll ask Murilo Baptista, who is in the room next to mine and depending on the response, I put here.
i am not sure if this is exactly what you mean, but i once impleneted a simple program which does something similar. you can have a look at the references below.
1) l .M Pecora and T .L Caroll, Fundementals of Synchronization of chaotic systems, concepts and applications, Chaos (1997)
I mean a mathematical proof that any chaos-based cryptography is "secure" in any sense (e.g. semantic security) . I am starting to study formal Cryptography now and I can figure out how chaos-based schemes can be compared with the conventional ones.
i see. i have not dealt with cryptography, but i the shceme i dealt with, if one loses track of the synchronizing chaotic signal, then the system diverges exponentially from the correct one. Which is why they are called chaotic. So if someone is trying to crack the signal and makes a small diversion from the driving chaotic signal, he/she will get a solution which diverges fast from the correct one. Ofcourse one can get as sophisticated as he wants in choosing a chaotic ODE and and a synchronization scheme ;)