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 the analysis and design of block and stream ciphers are also discussed.
Cite
CITATION STYLE
Golić, J. D. (1996). Fast low order approximation of cryptographic functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1070, pp. 268–282). Springer Verlag. https://doi.org/10.1007/3-540-68339-9_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
