(Imperfect) strategies to generate primitive polynomials over GF(2)

DOI10.1016/J.TCS.2021.03.007MaRDI QIDQ2034772zbMATH OpenOpenAlexFDO

Authors Sumit Adak, Sukanta Das

Publication date 23 June 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.03.007

zbMATH Keywords

cellular automatamaximal-length cellular automataprimitive polynomial

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Finite fields (field-theoretic aspects) (12E20) Cellular automata (computational aspects) (68Q80)

Recommendations

• A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation
• scientific article; zbMATH DE number 872088
• scientific article; zbMATH DE number 4027620
• A study on maximal length cellular automata and primitive polynomials in GF(2)
• On Using Prime Polynomials in Crypto Generators

Cites work

• A study on maximal length cellular automata and primitive polynomials in GF(2)
• Analysis of one-dimensional linear hybrid cellular automata over GF(q)
• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 3896307 (Why is no real title available?)
• scientific article; zbMATH DE number 1070886 (Why is no real title available?)
• Statistical mechanics of cellular automata

Cited in

(3)

• A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation
• A study on maximal length cellular automata and primitive polynomials in GF(2)
• Multiple-stream parallel pseudo-random number generation with cellular automata

This page was built for publication: (Imperfect) strategies to generate primitive polynomials over GF(2)

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