An FPGA accelerated search method for maximum period NLFSRs

DOI10.1007/978-3-031-81824-0_9MaRDI QIDQ6996921zbMATH OpenFDO

Authors Amund Askeland

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81824-0_9

zbMATH Keywords

feedback shift registersfield programmable gate arraynonlinear feedback shift register

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Data encryption (aspects in computer science) (68P25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites work

• A proof of Golomb's conjecture for the de Bruijn graph
• A survey of recent developments in cryptographic algorithms for smart cards
• Coding and Cryptography
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Searching for nonlinear feedback shift registers with parallel computing
• Shift Register Sequences
• Table of Irreducible Polynomials Over GF[ 2 ] of Degrees 10 Through 20
• Treue Darstellung Liescher Ringe.

This page was built for publication: An FPGA accelerated search method for maximum period NLFSRs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996921)