A parallel evolutionary approach to solving systems of equations in polycyclic groups

AbstractThe Anshel–Anshel–Goldfeld (AAG) key exchange protocol is based upon the multiple conjugacy problem for a finitely-presented group. The hardness in breaking this protocol relies on the supposed difficulty in solving the corresponding equations for the conjugating element in the group. Two such protocols based on polycyclic groups as a platform were recently proposed and were shown to be resistant to length-based attack. In this article we propose a parallel evolutionary approach which runs on multicore high-performance architectures. The approach is shown to be more efficient than previous attempts to break these protocols, and also more successful. Comprehensive data of experiments run with a GAP implementation are provided and compared to the results of earlier length-based attacks. These demonstrate that the proposed platform is not as secure as first thought and also show that existing measures of cryptographic complexity are not optimal. A more accurate alternative measure is suggested. Finally, a linear algebra attack for one of the protocols is introduced.</jats:p

Recent progress in an algebraic analysis approach to linear systems

This paper addresses systems of linear functional equations from an algebraic point of view. We give an introduction to and an overview of recent work by a small group of people including the author of this article on effective methods which determine structural properties of such systems. We focus on parametrizability of the behavior, i.e., the set of solutions in an appropriate signal space, which is equivalent to controllability in many control-theoretic situations. Flatness of the linear system corresponds to the existence of an injective parametrization. Using an algebraic analysis approach, we associate with a linear system a module over a ring of operators. For systems of linear partial differential equations we choose a ring of differential operators, for multidimensional discrete linear systems a ring of shift operators, for linear differential time-delay systems a combination of those, etc. Rings of these kinds are Ore algebras, which admit Janet basis or Gröbner basis computations. Module theory and homological algebra can then be applied effectively to study a linear system via its system module, the interpretation depending on the duality between equations and solutions. In particular, the problem of computing bases of finitely generated free modules (i.e., of computing flat outputs for linear systems) is addressed for different kinds of algebras of operators, e.g., the Weyl algebras. Some work on computer algebra packages, which have been developed in this context, is summarized

Lagrangian constraints and differential Thomas decomposition

publisher: Elsevier articletitle: Lagrangian constraints and differential Thomas decomposition journaltitle: Advances in Applied Mathematics articlelink: http://dx.doi.org/10.1016/j.aam.2015.09.005 content_type: article copyright: Crown copyright © 2015 Published by Elsevier Inc. All rights reserved

On the General Analytical Solution of the Kinematic Cosserat Equations

Based on a Lie symmetry analysis, we construct a closed form solution to the kinematic part of the (partial differential) Cosserat equations describing the mechanical behavior of elastic rods. The solution depends on two arbitrary analytical vector functions and is analytical everywhere except a certain domain of the independent variables in which one of the arbitrary vector functions satisfies a simple explicitly given algebraic relation. As our main theoretical result, in addition to the construction of the solution, we proof its generality. Based on this observation, a hybrid semi-analytical solver for highly viscous two-way coupled fluid-rod problems is developed which allows for the interactive high-fidelity simulations of flagellated microswimmers as a result of a substantial reduction of the numerical stiffness.Comment: 14 pages, 3 figure

Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems

For a wide class of polynomially nonlinear systems of partial differential equations we suggest an algorithmic approach to the s(trong)-consistency analysis of their finite difference approximations on Cartesian grids. First we apply the differential Thomas decomposition to the input system, resulting in a partition of the solution set. We consider the output simple subsystem that contains a solution of interest. Then, for this subsystem, we suggest an algorithm for verification of s-consistency for its finite difference approximation. For this purpose we develop a difference analogue of the differential Thomas decomposition, both of which jointly allow to verify the s-consistency of the approximation. As an application of our approach, we show how to produce s-consistent difference approximations to the incompressible Navier-Stokes equations including the pressure Poisson equation

Thomas Decomposition and Nonlinear Control Systems

This paper applies the Thomas decomposition technique to nonlinear control systems, in particular to the study of the dependence of the system behavior on parameters. Thomas\u27 algorithm is a symbolic method which splits a given system of nonlinear partial differential equations into a finite family of so-called simple systems which are formally integrable and define a partition of the solution set of the original differential system. Different simple systems of a Thomas decomposition describe different structural behavior of the control system in general. The paper gives an introduction to the Thomas decomposition method and shows how notions such as invertibility, observability and flat outputs can be studied. A Maple implementation of Thomas\u27 algorithm is used to illustrate the techniques on explicit examples

Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras

The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be published in Lecture Notes in Computer Scienc

Singularities of Algebraic Differential Equations

There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of ordinary or partial differential equations. Furthermore, we show how a combination of this geometric theory with (differential) algebraic tools allows us to make parts of the theory algorithmic. Our three main results are firstly a proof that even in the case of partial differential equations regular points are generic. Secondly, we present an algorithm for the effective detection of all singularities at a given order or, more precisely, for the determination of a regularity decomposition. Finally, we give a rigorous definition of a regular differential equation, a notoriously difficult notion ubiquitous in the geometric theory of differential equations, and show that our algorithm extracts from each prime component a regular differential equation. Our main tools are on the one hand the algebraic resp. differential Thomas decomposition and on the other hand the Vessiot theory of differential equations

A constructive study of the module structure of rings of partial differential operators

The purpose of this paper is to develop constructive versions of Stafford's theorems on the module structure of Weyl algebras A n (k) (i.e., the rings of partial differential operators with polynomial coefficients) over a base field k of characteristic zero. More generally, based on results of Stafford and Coutinho-Holland, we develop constructive versions of Stafford's theorems for very simple domains D. The algorithmization is based on the fact that certain inhomogeneous quadratic equations admit solutions in a very simple domain. We show how to explicitly compute a unimodular element of a finitely generated left D-module of rank at least two. This result is used to constructively decompose any finitely generated left D-module into a direct sum of a free left D-module and a left D-module of rank at most one. If the latter is torsion-free, then we explicitly show that it is isomorphic to a left ideal of D which can be generated by two elements. Then, we give an algorithm which reduces the number of generators of a finitely presented left D-module with module of relations of rank at least two. In particular, any finitely generated torsion left D-module can be generated by two elements and is the homomorphic image of a projective ideal whose construction is explicitly given. Moreover, a non-torsion but non-free left D-module of rank r can be generated by r+1 elements but no fewer. These results are implemented in the Stafford package for D=A n (k) and their system-theoretical interpretations are given within a D-module approach. Finally, we prove that the above results also hold for the ring of ordinary differential operators with either formal power series or locally convergent power series coefficients and, using a result of Caro-Levcovitz, also for the ring of partial differential operators with coefficients in the field of fractions of the ring of formal power series or of the ring of locally convergent power series. © 2014 Springer Science+Business Media