0000000000719031
AUTHOR
Ljupco Kocarev
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …
Tracking Control of Networked Multi-Agent Systems Under New Characterizations of Impulses and Its Applications in Robotic Systems
This paper examines the problem of tracking control of networked multi-agent systems with multiple delays and impulsive effects, whose results are applied to mechanical robotic systems. Four kinds of impulsive effects are taken into account: 1) both the strengths of impulsive effects and the number of nodes injected with impulses are time dependent; 2) the strengths of impulsive effects occur according to certain probabilities and the number of nodes under impulsive control is time varying; 3) the strengths of impulses are time varying, whereas the number of nodes with impulses takes place according to certain probabilities; 4) both the strengths of impulses and the number of nodes with imp…