Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
binary polynomials
Description:
Polynomials whose coefficients belong to the binary field, used in algebra, coding theory, and computational number theory.
Primary topic:
Coding theory and cryptography (37%)
Related topics:
Coding theory and cryptography (37%),
Cryptography and Residue Arithmetic (20%),
Polynomial and algebraic computation (10%)
OpenAlex ID:
keywords/binary-polynomials
Some applications of Rabin’s fingerprinting method
1993
·
Andrei Z. Broder
·
Springer eBooks
·
240
On the weight structure of Reed-Muller codes
1970
·
T. Kasami
, N. Tokura
·
IEEE Transactions on Information Theory
·
144
Primitive Binary Polynomials
1973
·
Wayne Stahnke
·
Mathematics of Computation
·
122
PDF
Testing Low-Degree Polynomials over GF(2)
2003
·
Noga Alon
, Tali Kaufman
, et al.
·
Lecture notes in computer science
·
120
Primitive Polynomials (Mod 2)
1962
·
E. J. Watson
·
Mathematics of Computation
·
112
PDF
Analysis of cellular automata used as pseudorandom pattern generators
2002
·
P.H. Bardell
·
IEEE International Test Conference (ITC)
·
111
On primitive trinomials (mod 2), II
1969
·
Neal Zierler
, John Brillhart
·
Information and Control
·
86
Faster Multiplication in GF(2)[x]
2008
·
Richard P. Brent
, Pierrick Gaudry
, et al.
·
Lecture notes in computer science
·
83
A Table of Primitive Binary Polynomials
1994
·
Miodrag Živković
·
Mathematics of Computation
·
57
PDF
Algebraic Decomposition for Probing Security
2015
·
Claude Carlet
, Emmanuel Prouff
, et al.
·
Lecture notes in computer science
·
50
On xn + x + 1 over GF(2)
1970
·
Neal Zierler
·
Information and Control
·
46
Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings
2008
·
Brent, Richard, P.
, Gaudry, Pierrick
, et al.
·
Lecture notes in computer science
·
40
PDF
On the number of irreducible polynomials with 0,1 coefficients
1999
·
S. Konyagin
·
Acta Arithmetica
·
38
PDF
Survey of binary Krawtchouk polynomials
2001
·
Ilia Krasikov
, Simon Litsyn
·
DIMACS series in discrete mathematics and theoretical computer science
·
37
Faster Multiplication in $$\mathbb {Z}_{2^m}[x]$$ on Cortex-M4 to Speed up NIST PQC Candidates
2019
·
Matthias J. Kannwischer
, Joost Rijneveld
, et al.
·
Lecture notes in computer science
·
36
Quartics over ${\rm GF}(2\sp{n})$
1972
·
Philip A. Leonard
, Kenneth S. Williams
·
Proceedings of the American Mathematical Society
·
36
PDF
On a conjecture about a class of permutation quadrinomials
2020
·
Kangquan Li
, Longjiang Qu
, et al.
·
Finite Fields and Their Applications
·
33
PDF
Algorithms for finding almost irreducible and almost primitive trinomials
2004
·
Richard Brent
, Paul Zimmermann
·
American Mathematical Society eBooks
·
33
Random Low Degree Polynomials are Hard to Approximate
2009
·
Ido Ben-Eliezer
, Rani Hod
, et al.
·
Computational Complexity
·
31
Some weak keys in McEliece public-key cryptosystem
2002
·
P. Loidrean
, N. Sendrier
·
IEEE International Symposium on Information Theory (ISIT)
·
30
A Construction of Public-Key Cryptosystem Based on Singular Simultaneous Equations
2005
·
M. KASAHARA
·
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
·
29
A reversible extended secret image sharing scheme based on Chinese remainder theorem
2021
·
Keju Meng
, Fuyou Miao
, et al.
·
Signal Processing Image Communication
·
28
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
1978
·
C.P. Schnorr
·
Theoretical Computer Science
·
28
On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR
2012
·
Zhen Ma
, Wen-Feng Qi
, et al.
·
Journal of Complexity
·
27
Irreducible polynomials over GF(2) with three prescribed coefficients
2003
·
Robert W. Fitzgerald
, Joseph L. Yucas
·
Finite Fields and Their Applications
·
27
PDF
Show more works
View as search
Works count:
265
Citation count:
2,617
Year
Topic
Type