Primitive polynomials over GF(2) -- a cryptologic approach

DOI10.1007/3-540-45600-7_3MaRDI QIDQ4473568zbMATH OpenFDO

Authors Kishan Chand Gupta, Subhamoy Maitra

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2229/22290023.htm

zbMATH Keywords

Cyclotomic CosetsGalois fieldPrimitive PolynomialsStream Cipher

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Results on multiples of primitive polynomials and their products over GF(2)
• Multiples of primitive polynomials over GF(2)
• Further results on multiples of primitive polynomials and their products over GF(2)
• On choice of connection-polynomials for LFSR-based stream ciphers.
• Multiples of primitive polynomials and their products over GF(2)

Cited in

(8)

• A simple stream cipher with proven properties
• Results on multiples of primitive polynomials and their products over GF(2)
• An implementation scheme of -LFSR based on trinomial primitive polynomial
• Distribution of primitive polynomials over \(\mathrm{GF}(2)\) with respect to their weights
• Multiples of primitive polynomials and their products over GF(2)
• Further results on multiples of primitive polynomials and their products over GF(2)
• Multiples of primitive polynomials over GF(2)
• Which Irreducible Polynomials Divide Trinomials over GF(2)?

This page was built for publication: Primitive polynomials over GF(2) -- a cryptologic approach

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