Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map

Details Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map

2006-04-06

arxiv.org/abs/cs/0604018v2

Computer Science

Cryptography and Security

Submitted to the Indian Academy of Sciences for possible publication in Sadhana (Academy Proceedings in Engineering Sciences).

Scientific paper

A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Henon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a strong resemblance to random sequences. Results of statistical testing of the sequences are found encouraging. An attempt is made to estimate the keyspace size if the proposed scheme is used for cryptographic applications. The keyspace size is found to be large and is dependent on the precision of the computing platform used.

Affiliated with

Also associated with

No associations

Rating

Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721113