Advertisement

Cybernetics and Systems Analysis

, Volume 52, Issue 4, pp 503–508 | Cite as

On the Efficiency of the Probabilistic Neutral Bits Method in Statistical Cryptanalysis of Synchronous Stream Ciphers

  • A. N. Alekseychuk
  • S. N. Konyushok
CYBERNETICS
  • 38 Downloads

Abstract

Achievable upper bounds are obtained for the relative distance between a Boolean function f and a function nearest to it and independent of variables with numbers from a given set and also between the function f and its subfunction obtained by fixing the mentioned variables to zeros. The expressions for the obtained bounds depend on metric characteristics of derivatives of the function f, which makes it possible to apply these bounds to the estimation and substantiation of the efficiency of the probabilistic neutral bits method.

Keywords

synchronous stream cipher statistical cryptanalysis method of probabilistic neutral bits approximation of Boolean functions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-Ph. Aumasson, S. Fischer, S. Khazaei, W. Meier, and C. Rechberger, “New features of Latin dances: Analysis of Salsa, ChaCha, and Rumba,” in: Proc Fast Software Encryption (FSE 2008), Springer, Berlin (2008), pp. 470–488.Google Scholar
  2. 2.
    S. Fischer, “Chosen IV statistical analysis for key recovery attacks on stream ciphers,” in: Proc. AFRICACRYPT 2008, S. Fischer, S. Khazaei, and W. Meier (eds.), Berlin: Springer (2008), pp. 236–245.Google Scholar
  3. 3.
    E. Dawson and C. K. Wu, “Construction of correlation immune Boolean functions,” in: Proc. Information and Communication Security, Springer, Berlin (1997), pp. 170–180.Google Scholar
  4. 4.
    E. Friedgut, “Boolean functions with low average sensitivity depend on few coordinates,” Combinatorica, 18, No. 1, 27–35 (1998).MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    A. Canteaut and M. Trabbia, “Improved fast correlation attacks using parity-check equations of weight 4 and 5,” in: Advances in Cryptology — EUROCRYPT’00, Springer, Berlin (2000), pp. 573–588.Google Scholar
  6. 6.
    A. Canteaut, “On the correlations between a combining function and function of fewer variables,” in: Proc. 2002 IEEE Information Theory Workshop, Springer, Berlin (2002), pp. 78–81.Google Scholar
  7. 7.
    P. Gopalan, R. O’Donnel, A. Servedio, A. Shpilka, and K. Wimmer, “Testing Fourier dimensionality and sparsity,” SIAM J. on Computing, 40, No. 4, 1075–1100 (2011).MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    E. K. Alekseev, “On some measures of nonlinearity for Boolean functions,” Applied Discrete Mathematics, 12, No. 2, 5–16 (2011).Google Scholar
  9. 9.
    A. N. Alekseychuk and S. N. Konyushok, “Algebraically degenerate approximations of Boolean functions,” Cybernetics and Systems Analysis, 50, No. 6, 817–839.Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Institute of Special Communication and Information Security of the National Technical University of Ukraine “KPI”KyivUkraine

Personalised recommendations