The paper applies chaotic encryption to information document, and designed a simple and fast encryption algorithm based on Sine Square Mapping. This kind of mapping can be chaotic in a wide parameter range and the sequences generated possess larger Lyapunov exponent and excellent dynamical properties. The keys of system's parameters, initial value and iterations are selected in order to let the chaotic encryption algorithm has a higher security and increase the key space. The simulation results show that the encryption algorithm of this paper can effectively resist the common assault of chaotic systems--statistical attack and brute-force attack.
CIS 2 is a steganographic scheme proposed formerly, belonging into the small category of algorithms being both stego and topologically secure. Due to its stego-security, this scheme is able to face attacks that take place into the “watermark only attack” framework. Its topological security reinforce its capability to face threats in other frameworks as “known message attack” or “known original attack”, in the Simmons' prisoner problem. In this research work, the study of topological properties of CIS 2 is enlarged by describing this scheme as iterations over the real line, and investigating other security properties of topological nature as the Lyapunov exponent, that have been reported as important in the field of information hiding security. Results show that this scheme is able to withdraw a malicious attacker in the “estimated original attack” context too.
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.