相关论文: On some cryptographic properties of Boolean functi…

We show that the derivative of a log-analytic function is log-analytic. We prove that log-analytic functions exhibit strong quasianalytic properties. We establish the parametric version of Tamm's theorem for log-analytic functions.

We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…

We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of…

For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…

The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions…

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

We investigate the electromagnetic duality properties of an abelian gauge theory on a compact oriented four-manifold by analysing the behaviour of a generalised partition function under modular transformations of the dimensionless coupling…

In this paper, we investigate the concepts of generalized twice differentiability and quadratic bundles of nonsmooth functions that have been very recently proposed by Rockafellar in the framework of second-order variational analysis. These…

Traditional cryptography is suffering a huge threat from the development of quantum computing. While many currently used public-key cryptosystems would be broken by Shor's algorithm, the effect of quantum computing on symmetric ones is…

For discretisations of hyperbolic conservation laws, mimicking properties of operators or solutions at the continuous (differential equation) level discretely has resulted in several successful methods. While well-posedness for nonlinear…

We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise…

We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-$k$-times Branching Programs or Ordered Binary Decision Diagrams with repeated test ($k$-QOBDD, $k$-NOBDD and $k$-POBDD). We show…

By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…

Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…

Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…

A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x,y))=x, L(J(x,y))=y and J(K(z),L(z))=z hold. Using pairing functions on natural…

We show that two dimensional QCD can, to a good approximation, describe the hadronic structure functions measured in Deep Inelastic Scattering. We transform this theory into a new form, Quantum HadronDynamics (QHD), whose semi-classical…

Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…

Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…