On the public citation graph

Algorithms for finding almost irreducible and almost primitive trinomials

0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44839-x_1openalex-snapshot
Random Number Generators with Period Divisible by a Mersenne Prime
inferredcites →https://doi.org/10.1007/3-540-57936-2_27openalex-snapshot
Constructive problems for irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1016/s0019-9958(69)90631-7openalex-snapshot
Primitive trinomials whose degree is a Mersenne exponent
inferredcites →https://doi.org/10.1016/s0304-3975(96)00278-2openalex-snapshot
Small weight bases for hamming codes
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1090/s0002-9904-1906-01403-3openalex-snapshot
Criteria for the irreducibility of functions in a finite field
inferredcites →https://doi.org/10.1090/s0002-9939-99-04795-4openalex-snapshot
Elements of provable high orders in finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-02-01478-3openalex-snapshot
A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377
inferredcites →https://doi.org/10.1090/s0025-5718-03-01515-1openalex-snapshot
Irreducible trinomials over finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1991-1068813-6openalex-snapshot
Primitive 𝑡-nomials (𝑡=3,5) over 𝐺𝐹(2) whose degree is a Mersenne exponent ≤44497
inferredcites →https://doi.org/10.1090/s0025-5718-99-00992-8openalex-snapshot
Factorization of the tenth Fermat number
inferredcites →https://doi.org/10.1090/s0025-5718-99-01168-0openalex-snapshot
New primitive 𝑡-nomials (𝑡=3,5) over 𝐺𝐹(2) whose degree is a Mersenne exponent
inferredcites →https://doi.org/10.1142/9361openalex-snapshot
Shift Register Sequences
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1142/s0129183192000361openalex-snapshot
NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
inferredcites →https://doi.org/10.2140/pjm.1962.12.1099openalex-snapshot
Factorization of polynomials over finite fields
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferredcites →https://doi.org/10.5860/choice.37-5723openalex-snapshot
Modern computer algebra
inferredcites →https://doi.org/10.7146/math.scand.a-10433openalex-snapshot
On a theorem of Stickelberger

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11423461_32openalex-snapshot
Which Irreducible Polynomials Divide Trinomials over GF(2)?
inferred← citeshttps://doi.org/10.1007/11558958_1openalex-snapshot
Fast and Reliable Random Number Generators for Scientific Computing
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_1openalex-snapshot
Random Number Generators with Period Divisible by a Mersenne Prime
inferred← citeshttps://doi.org/10.1007/978-3-030-01560-2_10openalex-snapshot
Cryptanalysis of 4-Bit Crypto S-Boxes in Smart Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-88323-2_8openalex-snapshot
A New Approach for Finding Low-Weight Polynomial Multiples
inferred← citeshttps://doi.org/10.1007/978-3-031-17433-9_24openalex-snapshot
Finding Low-Weight Polynomial Multiples Using the Rho Method
inferred← citeshttps://doi.org/10.1007/978-3-031-33488-7_14openalex-snapshot
Binary Kummer Line
inferred← citeshttps://doi.org/10.1007/978-3-031-76273-4_17openalex-snapshot
A New Pseudorandom Binary Generator Based on Nonlinear Feedback Registers with Boolean Function Combined Using Multiplexers
inferred← citeshttps://doi.org/10.1007/978-3-540-74496-2_36openalex-snapshot
SIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
inferred← citeshttps://doi.org/10.1007/978-3-540-77360-3openalex-snapshot
Selected Areas in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_23openalex-snapshot
A Practical Key Recovery Attack on Basic TCHo
inferred← citeshttps://doi.org/10.1007/978-3-642-04107-5_38openalex-snapshot
A PRNG Specialized in Double Precision Floating Point Numbers Using an Affine Transition
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_25openalex-snapshot
Computing Sparse Multiples of Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-662-53140-2_13openalex-snapshot
Software Implementation of Koblitz Curves over Quadratic Fields
inferred← citeshttps://doi.org/10.1007/s00145-018-9294-zopenalex-snapshot
Koblitz Curves over Quadratic Fields
inferred← citeshttps://doi.org/10.1007/s00453-012-9652-4openalex-snapshot
Computing Sparse Multiples of Polynomials
inferred← citeshttps://doi.org/10.1007/s11390-007-9003-0openalex-snapshot
Unified Parallel Systolic Multiplier Over ${\it GF}(2^{m})$
inferred← citeshttps://doi.org/10.1090/s0025-5718-04-01673-4openalex-snapshot
A primitive trinomial of degree 6972593
inferred← citeshttps://doi.org/10.1109/arith.2009.15openalex-snapshot
Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach
inferred← citeshttps://doi.org/10.1109/isit.2019.8849521openalex-snapshot
Procedure for Identifying Odd-sized Nucleotide Sequences as Codewords of BCH Codes over GF(4)
inferred← citeshttps://doi.org/10.1109/tc.2005.147openalex-snapshot
Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/tit.2006.889714openalex-snapshot
Irreducible Polynomials Which Divide Trinomials Over GF$\,(2)$
inferred← citeshttps://doi.org/10.48550/arxiv.1311.1366openalex-snapshot
Divisibility of Trinomials by Irreducible Polynomials over F2
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.