Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
On the linear complexity of Sidel’nikov Sequences over nonprime fields Nina Brandst¨atter a , Wilfried Meidl b a Johann Radon Institute for Computational and Applied Mathematics, Austrian
Add to Reading List
Document Date: 2008-06-03 16:50:30
Open Document
File Size: 194,65 KB
Share Result on Facebook
City
Istanbul /
Linz /
/
Country
Austria /
/
Facility
Sabancı University /
/
Organization
Johann Radon Institute for Computational and Applied Mathematics /
Austrian Academy of Sciences /
Sabancı University /
/
Person
Nina Brandst¨atter /
Wilfried Meidl /
/
/
Position
Prime Minister /
/
Technology
cryptography /
stream cipher /
/
SocialTag
Finite fields
Binomial coefficient
Combinatorics
Coding theory
Euclidean algorithm
Factorization of polynomials over a finite field and irreducibility tests
Mathematics
Abstract algebra
Polynomials
On the linear complexity of Sidel’nikov Sequences over nonprime fields Nina Brandst¨atter a , Wilfried Meidl b a Johann Radon Institute for Computational and Applied Mathematics, Austrian