On obtaining long m-sequences from low-degree primitive polynomials

DOI10.1016/J.DAM.2025.08.058MaRDI QIDQ6885582zbMATH OpenFDO

Authors D. Kagaris

Publication date 11 December 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.08.058

zbMATH Keywords

finite fieldsLFSRm-sequencesstream ciphers

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11Txx) Computational number theory (11Yxx) Communication, information (94Axx)

Cites work

• A fast algorithm to compute irreducible and primitive polynomials in finite fields
• A similarity transform for linear finite state machines
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• scientific article; zbMATH DE number 3458508 (Why is no real title available?)
• scientific article; zbMATH DE number 1951604 (Why is no real title available?)
• On The Computation of LFSR Characteristic Polynomials for Built-In Deterministic Test Pattern Generation
• Primitive polynomials and m-sequences over GF(q/sup m/)
• Relationships between m-sequences over GF(q) and GF(q/sup m/)
• Shift Register Sequences

This page was built for publication: On obtaining long m-sequences from low-degree primitive polynomials

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