Parametric Solutions of System of Linear Diophantine Equations by Crushing Method

There are studies on parametric solutions of system of Linear Diophantine equations based on uni-modular reductions of the coefficient matrix. In this paper we generate parametric solutions, with uni-modular row reductions on the coefficient matrix, based on the steps used in obtaining gcd of the coefficients in a row by crushing method. This application of gcd by crushing specifies an order for the row reductions and enables to give algorithm for the computations.

AN APPLICATION OF LINEAR DIOPHANTINE EQUATIONS TO CRYPTOGRAPHY

In this chapter we propose a Key exchange protocol based on a random solution of linear Diophantine equation in n variables, where the considered linear Diophantine equation satisfies the condition for existence of infinitely many solutions. Also the crypt analysis of the protocol is analysed.

Sparse representation of vectors in lattices and semigroups

We study the sparsity of the solutions to systems of linear Diophantine equations with and without non-negativity constraints. The sparsity of a solution vector is the number of its nonzero entries, which is referred to as the $$\ell _0$$ ℓ 0 -norm of the vector. Our main results are new improved bounds on the minimal $$\ell _0$$ ℓ 0 -norm of solutions to systems $$A\varvec{x}=\varvec{b}$$ A x = b , where $$A\in \mathbb {Z}^{m\times n}$$ A ∈ Z m × n , $${\varvec{b}}\in \mathbb {Z}^m$$ b ∈ Z m and $$\varvec{x}$$ x is either a general integer vector (lattice case) or a non-negative integer vector (semigroup case). In certain cases, we give polynomial time algorithms for computing solutions with $$\ell _0$$ ℓ 0 -norm satisfying the obtained bounds. We show that our bounds are tight. Our bounds can be seen as functions naturally generalizing the rank of a matrix over $$\mathbb {R}$$ R , to other subdomains such as $$\mathbb {Z}$$ Z . We show that these new rank-like functions are all NP-hard to compute in general, but polynomial-time computable for fixed number of variables.

Integral geometry on discrete matrices

In this note, we study the Radon transform and its dual on the discrete matrices by defining hyperplanes as being infinite sets of solutions of linear Diophantine equations. We then give an inversion formula and a support theorem.

The Mathematical Safe Problem and Its Solution (Part 2)

Introduction. The problem of mathematical safe arises in the theory of computer games and cryptographic applications. The article considers numerous variations of the mathematical safe problem and examples of its solution using systems of linear Diophantine equations in finite rings and fields. The purpose of the article. To present methods for solving the problem of a mathematical safe for its various variations, which are related both to the domain over which the problem is considered and to the structure of systems of linear equations over these domains. To consider the problem of a mathematical safe (in matrix and graph forms) in different variations over different finite domains and to demonstrate the work of methods for solving this problem and their efficiency (systems over finite simple fields, finite fields, ghost rings and finite associative-commutative rings). Results. Examples of solving the problem of a mathematical safe, the conditions for the existence of solutions in different areas, over which this problem is considered. The choice of the appropriate area over which the problem of the mathematical safe is considered, and the appropriate algorithm for solving it depends on the number of positions of the latches of the safe. All these algorithms are accompanied by estimates of their time complexity, which were considered in the first part of this paper. Conclusions. The considered methods and algorithms for solving linear equations and systems of linear equations in finite rings and fields allow to solve the problem of a mathematical safe in a large number of variations of its formulation (over finite prime field, finite field, primary associative-commutative ring and finite associative-commutative ring with unit). Keywords: mathematical safe, finite rings, finite fields, method, algorithm.

A Short Note On The Solution Of n-Refined Neutrosophic Linear Diophantine Equations

This paper is dedicated to studying the n-refined neutrosophic linear Diophantine equations. It provides for the first time an easy algorithm to solve these equations, with many related examples.