Computing Classes of Cryptographic Sequence Generators

A large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used in secret key cryptography. Ink this paper, a method of computing all the nonlinear filters applied to a shift register with a linear complexity LC ⿥ (▪), where L is the length of the register and k the orde...

Full description

Saved in:
Bibliographic Details
Published inProcedia computer science Vol. 18; pp. 2440 - 2443
Main Author Fúster-Sabater, A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2013
Subjects
Encryption function
Linear complexity
Nonlinear filter
Sequence generator
Stream cipher
Linear complexity
Nonlinear filter
Encryption function
Sequence generator
Stream cipher
Online AccessGet full text

Cover

More Information
Summary:A large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used in secret key cryptography. Ink this paper, a method of computing all the nonlinear filters applied to a shift register with a linear complexity LC ⿥ (▪), where L is the length of the register and k the order of the filter, is proposed. The procedure is based on the handling of filtering functions by means of algebraic operations. The method formally completes the family of nonlinear filtering functions with a guaranteed large linear complexity. In cryptographic terms, it means an easy and useful way of designing sequence generators for cryptographic purposes.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2013.05.419