loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Eric Filiol 1 ; 2 and Pierre Filiol 3

Affiliations: 1 Thales Digital Factory, Thales Group, Paris, France ; 2 ENSIBS, Vannes, France ; 3 Lab-STICC, ENSTA Bretagne, Brest, France

Keyword(s): NLFSR, Stream Cipher, Binary Sequence, Maximum Period, Graph Representation, Incidence Matrix.

Abstract: NonLinear Feedback Shift Registers (NLFSRs) are key primitives to design pseudorandom generators in modern stream ciphers, especially when the feedback function is of low degree. Contrary to their linear counterparts (LFSRs) for which a general and comprehensive theory has been established, many fundamental problems related to NLFSRs remain open. In particular finding a systematic procedure of acceptable complexity for constructing NLFSRs with a guaranteed long period is still a general open problem and only a few results have been obtained so far. In this paper, we present the results of a exhaustive exploratory search and analysis of NLFSRs of low degree. We first model NLFSRs as graphs using their incidence matrix and express the maximum period property as graph properties. This enables to reduce the number of possible candidates greatly that can be tested finally for the maximum period property by HPC on GPGPUs and Massively Parallel Processor Array (MPPA).

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.94.202.151

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Filiol, E. and Filiol, P. (2024). Graph-Based Modelling of Maximum Period Property for Nonlinear Feedback Shift Registers. In Proceedings of the 21st International Conference on Security and Cryptography - SECRYPT; ISBN 978-989-758-709-2; ISSN 2184-7711, SciTePress, pages 832-837. DOI: 10.5220/0012839300003767

@conference{secrypt24,
author={Eric Filiol. and Pierre Filiol.},
title={Graph-Based Modelling of Maximum Period Property for Nonlinear Feedback Shift Registers},
booktitle={Proceedings of the 21st International Conference on Security and Cryptography - SECRYPT},
year={2024},
pages={832-837},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012839300003767},
isbn={978-989-758-709-2},
issn={2184-7711},
}

TY - CONF

JO - Proceedings of the 21st International Conference on Security and Cryptography - SECRYPT
TI - Graph-Based Modelling of Maximum Period Property for Nonlinear Feedback Shift Registers
SN - 978-989-758-709-2
IS - 2184-7711
AU - Filiol, E.
AU - Filiol, P.
PY - 2024
SP - 832
EP - 837
DO - 10.5220/0012839300003767
PB - SciTePress