A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines | Zendy

Dominik Jochinger | Zendy; Franz Pichler | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines

Author(s) -

Dominik Jochinger,

Franz Pichler

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29002-8

DOI - 10.1007/11556985_41

Subject(s) - computer science , randomness , shift register , generator (circuit theory) , self shrinking generator , cryptography , linear feedback shift register , encryption , chaotic , transformation (genetics) , pseudorandom number generator , randomness tests , automaton , theoretical computer science , random number generation , algorithm , mathematics , operating system , artificial intelligence , electrical engineering , power (physics) , chip , chemistry , telecommunications , biochemistry , quantum mechanics , induction generator , statistics , physics , gene , wind power , engineering

In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register Machine (CBRM), which uses the sensitivity of chaotic behaviour and allows the application of automata- and shift-register theory. It is shown that a CBRM has good properties of randomness, such as large periods and high linear complexity. It can provide high cryptographic security with fast encryption speed, and can be realized effectively by both hardware and software.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research