By Topic

Exact Probabilistic Analysis of Memoryless Combiners

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Golic, J.D. ; Telecom Italia, Turin

Exact analytical expressions for various probability distributions in a type of stream ciphers known as memoryless combiners are derived. They relate to arbitrary linear functions and subvectors of output bits as well as to arbitrary linear functions and subvectors of input bits when the output sequence is assumed to be given. Practical approximations to the exact expressions to be used in one-step and iterative fast correlation attacks and statistical distinguishers are proposed. More generally, the results also apply to arbitrary binary linear codes that are nonlinearly transformed by time-variant Boolean functions. For comparison, the corresponding probability distributions for linear block codes on a memoryless time-variant binary symmetric channel are also determined and some practical consequences pointed out.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 11 )