The ANF of the composition of addition and multiplication mod 2n with a boolean function

4Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Compact formulas are derived to represent the Algebraic Normal Form (ANF) of f(x̄ + ā mod 2n) and f(x̄ × ā mod 2n) from the ANF of f, where f is a Boolean function on double struck F sign2n and ā is a constant of double struck F sign2n We compare the algebraic degree of the composed functions with the algebraic degree of the original function f. As an application, the formula for addition modulo 2n is applied in an algebraic attack on the summation generator and the E0 encryption scheme in the Bluetooth keystream generator. © International Association for Cryptologic Research 2005.

Cite

CITATION STYLE

APA

Braeken, A., & Semaev, I. (2005). The ANF of the composition of addition and multiplication mod 2n with a boolean function. In Lecture Notes in Computer Science (Vol. 3557, pp. 112–125). Springer Verlag. https://doi.org/10.1007/11502760_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free