Computation of Filtering Functions for Cryptographic Applications | Zendy

Amparo Fúster-Sabater | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computation of Filtering Functions for Cryptographic Applications

Author(s) -

Amparo Fúster-Sabater

Publication year - 2014

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2014.05.185

Subject(s) - computer science , cryptography , shift register , theoretical computer science , sequence (biology) , computation , binary number , algorithm , simple (philosophy) , key (lock) , arithmetic , mathematics , telecommunications , computer security , chip , philosophy , epistemology , biology , genetics

Large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used in secret key cryptography. In this paper, a method of computing all the nonlinear filtering functions applied to a shift register with a linear complexity where L is the register's length and k the order of the filter, is proposed. Emphasis is on the simple algebraic operations (addition and shifting of functions) included in the calculations. The method formally completes the family of nonlinear functions whose filtered sequences satisfy the previous lower bound on LC. In cryptographic terms, it means an easy and useful way of designing sequence generators for cryptographic purposes

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research