Related papers: BASS: Boolean Automorphisms Signature Scheme
We give a quantum algorithm for evaluating a class of boolean formulas (such as NAND trees and 3-majority trees) on a restricted set of inputs. Due to the structure of the allowed inputs, our algorithm can evaluate a depth $n$ tree using…
We give a complete description of the varieties of associative algebras over a field of characteristic zero which satisfy a polynomial identity of third degree.
It is already shown that a Boolean function for a NP-complete problem can be computed by a polynomial-sized circuit if its variables have enough number of automorphisms. Looking at this previous study from the different perspective gives us…
In this contribution, a Bayes Ying Yang(BYY) harmony based approach for on-line signature verification is presented. In the proposed method, a simple but effective Gaussian Mixture Models(GMMs) is used to represent for each user's signature…
In this work, we derive numerous identities for multivariate q-Euler polynomials by using umbral calculus.
This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…
We propose a method of optimizing monotone Boolean circuits by re-writing them in a simpler, equivalent form. We use in total six heuristics: Hill Climbing, Simulated Annealing, and variations of them, which operate on the representation of…
We present a symbolic perturbation scheme for arbitrary polynomial geometric predicates which combines the benefits of Emiris and Canny's simple randomized linear perturbation scheme with Yap's multiple infinitesimal scheme for general…
Let f be a generic polynomial mapping mapping from the plane to the plane. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of f.
This paper presents a new identity based strong designated verifier parallel multi-proxy signature scheme. Multi-Proxy signatures allow the original signer to delegate his signing power to a group of proxy signers. In our scheme, the…
Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…
In this thesis, we propose some directed signature schemes. In addition, we have discussed their applications in different situations. In this thesis, we would like to discuss the security aspects during the design process of the proposed…
For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
We introduce a scheme for the membership verification, a scheme for a secret ballot, a scheme for the unanimity rule which can hide the number of voter using some partition number identities.
The signature of a parametric curve is a sequence of tensors whose entries are iterated integrals. This construction is central to the theory of rough paths in stochastic analysis. It is here examined through the lens of algebraic geometry.…
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
In this paper, we present a new axiomatic system that is a minimal axiomatization of Boolean algebras. Furthermore, the symmetric difference is shown to be algebraically analogous to the modular difference of two numbers. Finally, a new…
We present a different proof of the following identity due to Munarini, which generalizes a curious binomial identity of Simons. \begin{align*} \sum_{k=0}^{n}\binom{\alpha}{n-k}\binom{\beta+k}{k}x^k…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…