Linear Complexity of Binary Sequences Derived from Polynomial Quotients
type: Item
instance of: scholarly article
title: Linear Complexity of Binary Sequences Derived from Polynomial Quotients
zbMATH Open document ID: 1304.94024
DOI: 10.1007/978-3-642-30615-0_17
published in: Lecture Notes in Computer Science
publication date: 2012-09-07T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6079469
zbMATH Keywords: Fermat quotients
zbMATH Keywords: polynomial quotients
zbMATH Keywords: finite fields
zbMATH Keywords: pseudorandom binary sequences
zbMATH Keywords: linear complexity
zbMATH Keywords: cryptography
MaRDI profile type: Publication
full work available at URL: 978-3-642-30615-0 17
OpenAlex ID: W85945872
author: Zhixiong Chen
author: Domingo Gómez-Pérez
description: scientific article; zbMATH DE number 6079469