The vulnerability of geometric sequences based on fields of odd characteristic
type: Item
instance of: scholarly article
title: The vulnerability of geometric sequences based on fields of odd characteristic
zbMATH Open document ID: 0794.94006
DOI: 10.1007/BF00195208
published in: Journal of Cryptology
publication date: 1994-09-04T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 575836
zbMATH Keywords: cryptanalysis
zbMATH Keywords: Galois field
zbMATH Keywords: binary sequences
zbMATH Keywords: linear complexity
zbMATH Keywords: binary geometric sequence
zbMATH Keywords: randomized algorithm
zbMATH Keywords: partial imbalance
author: Andrew Klapper
MaRDI profile type: Publication
cites work: Q5654809
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Q3778671
cites work: On Functions of Linear Shift Register Sequences
cites work: Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences
cites work: Q4314034
cites work: Q3216750
cites work: On the p-rank of the design matrix of a difference set
cites work: Shift-register synthesis and BCH decoding
cites work: Q3813755
cites work: On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
cites work: Q3994378
cites work: Products of linear recurring sequences
description: scientific article; zbMATH DE number 575836