Related papers: Symbolic Protocol Analysis for Diffie-Hellman
Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although the termination of this algorithm is far from obvious, its equivalence to the traditional recursive…
The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…
We extend the classical regularity theorem of elliptic operators to maximally hypoelliptic differential operators. More precisely, given vector fields $X_1,\ldots,X_m$ on a smooth manifold which satisfy H\"ormander's bracket generating…
A differential-algebraic geometric analogue of the Dixmier-Moeglin equivalence is articulated, and proven to hold for $D$-groups over the constants. The model theory of differentially closed fields of characteristic zero, in particular the…
We put forward a conjecture about an universal asymptotical behaviour of the symbol of the Dirichlet-to-Neumann operator (considered as a pseudodifferential operator) in the 2D exterior problem for the Hemholtz equation. The conjecture is…
We develop a Koopman operator framework for studying the {computational properties} of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ``Koopman…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
We consider a class of monotone operators which are appropriate for symbolic representation and manipulation within a computer algebra system. Various structural properties of the class (e.g., closure under taking inverses, resolvents) are…
Multi-protocol attacks due to protocol interaction has been a notorious problem for security. Gutman-Thayer proved that they can be prevented by ensuring that encrypted messages are distinguishable across protocols, under a free algebra. In…
The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new…
We demonstrate a method of associating the principal symbol at a $K$-point with a linear differential operator acting between modules over a commutative algebra, and we use it to define the ellipticity of a linear differential operator in a…
Symbol letters are crucial for analytically calculating Feynman integrals in terms of iterated integrals. We present a novel method to construct the symbol letters for a given integral family without prior knowledge of the canonical…
Definitions of new symbols merely abbreviate expressions in logical frameworks, and no new facts (regarding previously defined symbols) should hold because of a new definition. In Isabelle/HOL, definable symbols are types and constants. The…
For a von Neumann algebra M acting on a Hilbert space H with a cyclic and separating vector v, we investigate the structure of Dirichlet forms on the natural standard form associated with the pair (M,v). For a general Lindblad type…
A Dirichlet operator algebra is a nonself-adjoint operator algebra $\mathcal{A}$ with the property that $\mathcal{A} + \mathcal{A}^*$ is norm-dense in the C$^*$-envelope of $\mathcal{A}.$ We show that, under certain restrictions,…
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message $M$ can be deduced from a set of messages $\Gamma$ under the theory of blind signatures and arbitrary convergent…
Several of the basic cryptographic constructs have associated algebraic structures. Formal models proposed by Dolev and Yao to study the (unconditional) security of public key protocols form a group. The security of some types of protocols…
The formal analysis of security protocols is a challenging field, with various approaches being studied nowadays. The famous Burrows-Abadi-Needham Logic was the first logical system aiming to validate security protocols. Combining ideas…
In this paper, we show a new tagging scheme for cryptographic protocol messages. Under this tagging, equational theories of operators such as exclusive-or, binary addition etc. are effectively disabled, when terms are unified. We believe…
We consider differential operators between sections of arbitrary powers of the determinant line bundle over a contact manifold. We extend the standard notions of the Heisenberg calculus: noncommutative symbolic calculus, the principal…