The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Algebraic attacks on stream ciphers can be transformed to search for low-degree annihilators of Boolean function. The relations between support set and degree of Boolean function are thoroughly discussed using the special structure and properties of Boolean functions and matrix on {0,1}, we transform seeking Boolean function annihilators to seeking the largest affine space in root set.
Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of linear Boolean functions, where by the discussion is based on the transformation from the Boolean domain to the Haar domain. The resulting spectrum is given with the corresponding calculations...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.