The Error Linear Complexity Spectrum as a Cryptographic Criterion of Boolean Functions

The error linear complexity spectrum constitutes a well-known cryptographic criterion for sequences, indicating how the linear complexity of the sequence decreases as the number of bits allowed to be modified per period increases. In this paper, via defining an association between <inline-formula...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 65; no. 12; pp. 8345 - 8356
Main Authors:	Limniotis, Konstantinos, Kolokotronis, Nicholas
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation algorithms Approximations Boolean algebra Boolean functions Ciphers Codes Communication channels Complexity Complexity theory Correlation Criteria Cryptography error linear complexity spectrum Input variables Lauder-Paterson algorithm Upper bounds
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!