Linear complexity profiles and jump complexity

DOI10.1016/S0020-0190(97)00004-5zbMATH Open1336.94032OpenAlexW2013034268MaRDI QIDQ290210FDOQ290210

Authors: M. Z. Wang 

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00004-5

Recommendations

• scientific article; zbMATH DE number 177032
• Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
• Linear Complexity and Random Sequences
• Progress in Cryptology - INDOCRYPT 2003
• Linear complexity and related complexity measures

zbMATH Keywords

cryptographylinear complexitypseudo-random sequences

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Shift-register synthesis and BCH decoding
• Perfect staircase profile of linear complexity for finite sequences
• New binary sequences with perfect staircase profile of linear complexity
• Linear Complexity and Random Sequences

Cited In (5)

• Title not available (Why is that?)
• Jump and hop randomness tests for binary sequences
• Title not available (Why is that?)
• On distribution properties of sequences with perfect linear complexity profile
• Enumeration results on linear complexity profiles and lattice profiles

This page was built for publication: Linear complexity profiles and jump complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290210)