On the public citation graph
The vulnerability of geometric sequences based on fields of odd characteristic
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-39805-8_14openalex-snapshot
On Functions of Linear Shift Register Sequences
inferredcites →https://doi.org/10.1007/3-540-39805-8_19openalex-snapshot
On the Linear Complexity of Combined Shift Register Sequences
inferredcites →https://doi.org/10.1007/3-540-47721-7_29openalex-snapshot
On the Linear Span of Binary Sequences Obtained from Finite Geometries
inferredcites →https://doi.org/10.1007/3-540-57332-1_23openalex-snapshot
Revealing information with partial period correlations (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1016/0021-8693(73)90170-1openalex-snapshot
Products of linear recurring sequences
inferredcites →https://doi.org/10.1016/0166-218x(93)90155-hopenalex-snapshot
Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences
inferredcites →https://doi.org/10.1016/s0019-9958(68)90534-2openalex-snapshot
On the p-rank of the design matrix of a difference set
inferredcites →https://doi.org/10.1016/s0021-9800(69)80046-3openalex-snapshot
On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
inferredcites →https://doi.org/10.1081/e-ewmc2-120043935openalex-snapshot
Spread-Spectrum Communications
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.2307/2288240openalex-snapshot
Probability Theory and Elements of Measure Theory.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4openalex-snapshot
Topics in Geometry, Coding Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-60590-8_14openalex-snapshot
Feedback with carry shift registers over finite fields
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_23openalex-snapshot
On the Existence of Secure Feedback Registers
inferred← citeshttps://doi.org/10.1007/bf01418531openalex-snapshot
Cross-correlations of geometric sequences in characteristic two
inferred← citeshttps://doi.org/10.1007/s001450010014openalex-snapshot
On the Existence of Secure Keystream Generators
inferred← citeshttps://doi.org/10.1007/s00500-017-2870-6openalex-snapshot
Linear complexity of a class of pseudorandom sequences over a general finite field
inferred← citeshttps://doi.org/10.1007/s11401-016-1023-zopenalex-snapshot
On the GF(p) linear complexity of Hall’s sextic sequences and some cyclotomic-set-based sequences
inferred← citeshttps://doi.org/10.1007/s11859-012-0871-yopenalex-snapshot
New chaotic image encryption algorithm based on cross-mapping
inferred← citeshttps://doi.org/10.1007/s12095-015-0138-5openalex-snapshot
Linear complexity of Ding-Helleseth sequences of order 2 over GF(l)
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.08.004openalex-snapshot
On the linear complexity of bounded integer sequences over different moduli
inferred← citeshttps://doi.org/10.1016/j.jco.2015.01.001openalex-snapshot
Linear complexity of binary generalized cyclotomic sequences over GF( q )
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00066-3openalex-snapshot
Algebraic feedback shift registers
inferred← citeshttps://doi.org/10.1016/s1005-8885(08)60257-5openalex-snapshot
On GF(p)-linear complexities of binary sequences
inferred← citeshttps://doi.org/10.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1017/cbo9781139057448openalex-snapshot
Algebraic Shift Register Sequences
inferred← citeshttps://doi.org/10.1109/18.312172openalex-snapshot
Partial period autocorrelations of geometric sequences
inferred← citeshttps://doi.org/10.1109/18.481798openalex-snapshot
Partial period crosscorrelations of geometric sequences
inferred← citeshttps://doi.org/10.1109/icmss.2009.5302775openalex-snapshot
A Novel Method of Chaotic Image Encryption Based on LFSR
inferred← citeshttps://doi.org/10.1109/tit.2014.2304451openalex-snapshot
A New Method to Compute the 2-Adic Complexity of Binary Sequences
inferred← citeshttps://doi.org/10.1145/191177.191227openalex-snapshot
How to break Gifford's cipher (extended abstract)
inferred← citeshttps://doi.org/10.1201/9781584888215-c17openalex-snapshot
Pseudorandom Sequences and Stream Ciphers
inferred← citeshttps://doi.org/10.3934/amc.2018031openalex-snapshot
On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
inferred← citeshttps://doi.org/10.4213/dm342openalex-snapshot
Полиномиальные преобразования линейных рекуррентных последовательностей над конечными коммутативными кольцами
inferred← citeshttps://doi.org/10.4213/dm373openalex-snapshot
Полиномиальные преобразования линейных рекуррентных последовательностей над кольцом $\mathbf Z_{p^2}$
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
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.