The vulnerability of geometric sequences based on fields of odd characteristic

DOI10.1007/BF00195208zbMath0794.94006MaRDI QIDQ1324757

Andrew Klapper

Publication date: 4 September 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

binary sequencesrandomized algorithmcryptanalysislinear complexityGalois fieldbinary geometric sequencepartial imbalance

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (7)

Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences ⋮ Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) ⋮ New chaotic image encryption algorithm based on cross-mapping ⋮ On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation ⋮ Linear complexity of a class of pseudorandom sequences over a general finite field ⋮ On the linear complexity of bounded integer sequences over different moduli

Cites Work

• Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences
• Products of linear recurring sequences
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• On Functions of Linear Shift Register Sequences
• Shift-register synthesis and BCH decoding
• On the p-rank of the design matrix of a difference set
• On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The vulnerability of geometric sequences based on fields of odd characteristic