Pseudorandom generators based on Lucas Sequences

Pseudorandom generators based on Lucas Sequences

Pseudo-random sequence generators are the heart of Stream-cipher systems. This work presents some design criteria for such generators. based on innovative methods. To this aim the Lucas Sequences, reduced modulo a prime p. are taken and suitably manipulated. Modular Exponentiation is the function us...

Full description

Bibliographic Details
Main Authors: A Di Porto, W Wolfowics
Format: Article
Language:English
Published: Accademia Piceno Aprutina dei Velati 1993-02-01
Series:Ratio Mathematica
Online Access:http://eiris.it/ojs/index.php/ratiomathematica/article/view/172
id doaj-f6e10d73ab98483f83f7ad7e534b183a
record_format Article
spelling doaj-f6e10d73ab98483f83f7ad7e534b183a2020-11-24T23:08:14ZengAccademia Piceno Aprutina dei VelatiRatio Mathematica1592-74152282-82141993-02-01611522178Pseudorandom generators based on Lucas SequencesA Di Porto0W Wolfowics1Fondazione Ugo Bordoni, Rome, ItalyFondazione Ugo Bordoni, Rome, ItalyPseudo-random sequence generators are the heart of Stream-cipher systems. This work presents some design criteria for such generators. based on innovative methods. To this aim the Lucas Sequences, reduced modulo a prime p. are taken and suitably manipulated. Modular Exponentiation is the function used to attain the output sequences. The periodicity of the Lucas Sequences allows to define a lower bound for the period of the generated sequences; actually our purpose is to ensure that the sequences which are generated have a period greater than a prefixed value. Furthermore the cryptographic strength of these sequences relies on the one-wayness of the discrete logarithm problem.http://eiris.it/ojs/index.php/ratiomathematica/article/view/172
collection DOAJ
language English
format Article
sources DOAJ
author A Di Porto
W Wolfowics
spellingShingle A Di Porto
W Wolfowics
Pseudorandom generators based on Lucas Sequences
Ratio Mathematica
author_facet A Di Porto
W Wolfowics
author_sort A Di Porto
title Pseudorandom generators based on Lucas Sequences
title_short Pseudorandom generators based on Lucas Sequences
title_full Pseudorandom generators based on Lucas Sequences
title_fullStr Pseudorandom generators based on Lucas Sequences
title_full_unstemmed Pseudorandom generators based on Lucas Sequences
title_sort pseudorandom generators based on lucas sequences
publisher Accademia Piceno Aprutina dei Velati
series Ratio Mathematica
issn 1592-7415
2282-8214
publishDate 1993-02-01
description Pseudo-random sequence generators are the heart of Stream-cipher systems. This work presents some design criteria for such generators. based on innovative methods. To this aim the Lucas Sequences, reduced modulo a prime p. are taken and suitably manipulated. Modular Exponentiation is the function used to attain the output sequences. The periodicity of the Lucas Sequences allows to define a lower bound for the period of the generated sequences; actually our purpose is to ensure that the sequences which are generated have a period greater than a prefixed value. Furthermore the cryptographic strength of these sequences relies on the one-wayness of the discrete logarithm problem.
url http://eiris.it/ojs/index.php/ratiomathematica/article/view/172
work_keys_str_mv AT adiporto pseudorandomgeneratorsbasedonlucassequences
AT wwolfowics pseudorandomgeneratorsbasedonlucassequences
_version_ 1725615311516860416

Similar Items