Displaying similar documents to “Fast Bitwise Implementation of the Algebraic Normal Form Transform”

Algorithms for Computing the Linearity and Degree of Vectorial Boolean Functions

Bouyuklieva, Stefka, Bouyukliev, Iliya (2016)

Serdica Journal of Computing

Similarity:

In this article, we study two representations of a Boolean function which are very important in the context of cryptography. We describe Möbius and Walsh Transforms for Boolean functions in details and present effective algorithms for their implementation. We combine these algorithms with the Gray code to compute the linearity, nonlinearity and algebraic degree of a vectorial Boolean function. Such a detailed consideration will be very helpful for students studying the design of block...

Some extensions of a certain integral transform to a quotient space of generalized functions

Shrideh K.Q. Al-Omari, Jafar F. Al-Omari (2015)

Open Mathematics

Similarity:

In this paper, we establish certain spaces of generalized functions for a class of ɛs2,1 transforms. We give the definition and derive certain properties of the extended ɛs2,1 transform in a context of Boehmian spaces. The extended ɛs2,1 transform is therefore well defined, linear and consistent with the classical ɛs2,1 transforms. Certain results are also established in some detail.

[unknown]

Kokila Sundaram (1983)

Revista de la Real Academia de Ciencias Exactas Físicas y Naturales

Similarity:

The Laplace transform on a Boehmian space

V. Karunakaran, C. Prasanna Devi (2010)

Annales Polonici Mathematici

Similarity:

In the literature a Boehmian space containing all right-sided Laplace transformable distributions is defined and studied. Besides obtaining basic properties of this Laplace transform, an inversion formula is also obtained. In this paper we shall improve upon two theorems one of which relates to the continuity of this Laplace transform and the other is concerned with the inversion formula.

Efficient calculation of the Reed-Muller form by means of the Walsh transform

Piotr Porwik (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to...