Pseudorandom Numbered Hybrid Crypto-Algorithm with Two Bit Crossover and Boundary Mutation

In spite of all the advantages while using networks in any form, there are large numbers of possible security issues that are rising with networking. To sort the security issues network security is the action that is intended to safe guard the resources and integrity of network and data. At work stations there are filters, firewall to protect. But while data in transmission security services are needed and frequent change in methods are to be developed to counter threats. In this work different methods like pseudorandom generation and multiple genetic algorithms are used that resembles quite different in nature. This proposed hybrid algorithm can be used in small business applications where they are frequently hacked. Small organizations that cannot afford to build a strong security system can use such hybrid systems.

On the complexity of binary floating point pseudorandom generation

The paper is devoted to the complexity analysis of binary floating point pseudorandom generators. We start with a stochastic model of a “usual” pseudorandom generator (PRNG). Then integer outputs of this generator are transformed into i.i.d. random variables, agreed with an abstract binary floating point system. Additionally, these random variables are approximately uniformly distributed on the interval [0,1]. Therefore, they can interpreted as (random) outputs of a binary floating point pseudorandom generator (flPRNG). The simulation complexity of such a transformation is defined as the average number of PRNG's outputs necessary to produce the unique output of flPRNG. Several transformations with minimal or approximately minimal complexities are presented and discussed.