License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09031.11
URN: urn:nbn:de:0030-drops-19569
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/1956/
Go to the corresponding Portal


Röck, Andrea ; Lauradoux, Cédric

Parallel Generation of l-Sequences

pdf-format:
09031.RoeckAndrea.ExtAbstract.1956.pdf (0.3 MB)


Abstract

The generation of pseudo-random sequences at a high rate is
an important issue in modern communication schemes. The
representation of a sequence can be scaled by decimation
to obtain parallelism and more precisely a sub-sequences generator.
Sub-sequences generators and therefore decimation have been
extensively used in the past for linear feedback shift
registers (LFSRs). However, the case of automata with a non
linear feedback is still in suspend. In this work, we have studied
how to transform of a feedback with carry shift register (FCSR) into a
sub-sequences generator. We examine two solutions for this
transformation, one based on the decimation properties of $ell$-sequences,
extit{i.e.} FCSR sequences with maximal period, and the other one based
on multiple steps implementation.
We show that the solution based on the decimation properties leads to much
more costly results than in the case of LFSRs. For the multiple steps
implementation, we show how the propagation of carries affects the design.
par This work represents a cooperation with Cédric Lauradoux and was
presented at the international conference on SEquences and Their
Applications (SETA) 2008.

BibTeX - Entry

@InProceedings{rock_et_al:DagSemProc.09031.11,
  author =	{R\"{o}ck, Andrea and Lauradoux, C\'{e}dric},
  title =	{{Parallel Generation of l-Sequences}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9031},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/1956},
  URN =		{urn:nbn:de:0030-drops-19569},
  doi =		{10.4230/DagSemProc.09031.11},
  annote =	{Keywords: Sequences, synthesis, decimation, parallelism, LFSRs, FCSRs}
}

Keywords: Sequences, synthesis, decimation, parallelism, LFSRs, FCSRs
Collection: 09031 - Symmetric Cryptography
Issue Date: 2009
Date of publication: 30.03.2009


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI