Abstract
A new concept of compound symbolic chaotic series is proposed. According to the kneading pair series in symbolic dynamics, by compounding a pseudo-random series with sub-series on condition of kneading rules we obtain a new symbolic chaotic series which is then transformed into a pseudo-random binary number (PRN) series. The length of the new PRN series elongates at a speed of geometric procession with iteration number. Theoretical and experimental analyses both prove that the above algorithm provides an effective PRN generator. To apply the algorithm to digital secure communication, a new cellular automata is established. With the automata, the data expansion is avoided, the encryption is finished quickly, the obvious avalanche effect can be produced, and thus the security is improved.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
