Fast low order approximation of cryptographic functions

  • Authors:
  • Jovan Dj. Golic

  • Affiliations:
  • Information Security Research Centre, Queensland University of Technology, Brisbane, Australia and School of Electrical Engineering, University of Belgrade

  • Venue:
  • EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1996

Quantified Score

Hi-index 0.06

Visualization

Abstract

A fast and efficient procedure for finding low order approximations to large boolean functions, if such approximations exist, is developed. The procedure uses iterative error-correction algorithms for fast correlation attacks on certain stream ciphers and is based on representing low order boolean functions by appropriate linear recurring sequences generated by binary filter generators. Applications and significance of the proposed method in thc analysis and design of block and stream ciphers are also discussed.