Elliptic Curve Pseudorandom Sequence Generator

Pseudorandom sequences have wide application in spread-spectrum communicat ion systems,code division multiple-access systems,software testing,stream ciphers and public cryptosystems.Especially the security of stream ciphers heavily depends on the randomness and the unpredictability of the key streams.It is a hot-spot to construct pseudorandom sequences for use.This dissertation investigates the construction of pseudorandom sequences.In this paper,we give an introduction to the background of pseudorandom sequences and its application and research.Then show the development and the latest research.In chapter 2,there is exordium of pseudorandom sequence and elliptic curves.The following part is some classic pseudorandom sequence based on hard problem such as RSA.In Chapter 3,we give a detailed description of bit extractor and perfect proof.In chapter 4,we show the history of EC_ pseudorandom sequences and the latest results.There are some classic methods to construct binary sequences, interleaved sequences and index sequences.For Dual_EC_DRBG,we give a detailed description.Hash Functions have wide application in cryptology.Having this idea,we give a new model of EC random number generator.The New Generator is based on the safety of Hash Function and ECDLR It has high speed and application advantage.The main work of this thesis is as follows:·Give a new model of EC pseudorandom sequence,prove its safety and analysis its speed.·Description of the main technology of bit extractor and its safety proof.·Give an introduction to the main methods of EC linear congruential sequences and EC index sequences.