Related papers: BASS: Boolean Automorphisms Signature Scheme
This paper suggests a message authentication scheme, which can be efficiently used for secure digital signature creation. The algorithm used here is an adjusted union of the concepts which underlie projective geometry and group structure on…
Amoebas and coamoebas are the logarithmic images of algebraic varieties and the images of algebraic varieties under the arg-map, respectively. We present new techniques for computational problems on amoebas and coamoebas, thus establishing…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…
Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party…
We develop a general and unconditional framework for certifying the global nonnegativity of multivariate integer polynomials; based on rewriting them as sum of squares modulo their gradient ideals. We remove the two structural assumptions…
Various techniques have been used in recent years for verifying quantum computers, that is, for determining whether a quantum computer/system satisfies a given formal specification of correctness. Barrier certificates are a recent novel…
We introduce a signature inversion scheme for $C^1$-axial linear curves which are widely used in various areas. We show that in the presence of a linear coordinate function, the derivatives of the underlying curve at any point $x$ can be…
We present a proof procedure for univariate real polynomial problems in Isabelle/HOL. The core mathematics of our procedure is based on univariate cylindrical algebraic decomposition. We follow the approach of untrusted certificates,…
Automatic recognition of signature is a challenging problem which has received much attention during recent years due to its many applications in different fields. Signature has been used for long time for verification and authentication…
A new method for document watermarking based on the digital Fourier hologram is proposed. It applies the methods of digital image watermarking based on holographic principle presented previously in several papers into printed documents.…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based…
This paper uses Support Vector Machines (SVM) to fuse multiple classifiers for an offline signature system. From the signature images, global and local features are extracted and the signatures are verified with the help of Gaussian…
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
The group of automorphisms is found for the Lie algebra of polynomial vector fields with constant divergence.
This paper presents a new compact canonical-based algorithm to solve the problem of single-output completely specified NPN Boolean matching. We propose a new signature vector Boolean difference and cofactor (DC) signature vector. Our…
We study the plane automorphisms given by polynomials with certain degree decompositions.