Related papers: BASS: Boolean Automorphisms Signature Scheme
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
The general principle for a quantum signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and…
Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by showing that the latter give distinct results when evaluated at…
This article deals with new polynomial time algorithm for graph isomorphism testing.
Hyperproperties are system properties that require quantification over multiple execution traces of a system. Hyperproperties can express several specifications of interest for cyber-physical systems--such as opacity, robustness, and…
Previous work has made use of a parameterized plane curve polynomial representation for mathematical handwriting, with the polynomials represented in a Legendre or Legendre-Sobolev graded basis. This provides a compact geometric…
Signature verification is an authentication technique that considers handwritten signature as a biometric. From a biometric perspective this project made use of automatic means through an integration of intelligent algorithms to perform…
Discrete signatures are invariants computed from time series corresponding to the discretised version of the signature of paths. We study the algebraic varieties arising from their images, the discrete signature varieties. We introduce them…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
A numerical scheme based on modified method of characteristics with adjusted advection (MMOCAA) is proposed to approximate the solution of the system liquid chromatography with multi components case. For the case of one component, the…
Applying Gr\"obner basis theory to concrete problems in Lean 4 remains difficult since the current formalization of multivariate polynomials is based on a non-computable representation and is therefore not suitable for efficient symbolic…
A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…
We propose a general way of constructing zero-knowledge authentication schemes from actions of a semigroup on a set, without exploiting any specific algebraic properties of the set acted upon. Then we give several concrete realizations of…
Certifying safety in dynamical systems is crucial, but barrier certificates - widely used to verify that system trajectories remain within a safe region - typically require explicit system models. When dynamics are unknown, data-driven…
We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.
Document digitization is becoming increasingly crucial. In this work, we propose a shape based approach for automatic stamp verification/detection in document images using an unsupervised feature learning. Given a small set of training…
Numerical homogenization, i.e. the finite-dimensional approximation of solution spaces of PDEs with arbitrary rough coefficients, requires the identification of accurate basis elements. These basis elements are oftentimes found after a…
Signatures are primarily used as a mark of authenticity, to demonstrate that the sender of a message is who they claim to be. In the current digital age, signatures underpin trust in the vast majority of information that we exchange,…
Automated signature verification is a critical biometric technique used in banking, identity authentication, and legal documentation. Despite the notable progress achieved by deep learning methods, most approaches in offline signature…