DeepAI AI Chat
Log In Sign Up

On the Complexity of Solving Generic Over-determined Bilinear Systems

by   John B. Baena, et al.
Universidad Nacional de Colombia

In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field 𝔽. Given a generic bilinear sequence B βˆˆπ”½[𝐱,𝐲], with respect to a partition of variables 𝐱, 𝐲, we show that, the solutions of the system B= 0 can be efficiently found on the 𝔽[𝐲]-module generated by B. Following this observation, we propose three variations of GrΓΆbner basis algorithms, that only involve multiplication by monomials in they-variables, namely, 𝐲-XL, based on the XL algorithm, 𝐲-MLX, based on the mutant XL algorithm, and 𝐲-HXL, basedon a hybrid approach. We define notions of regularity for over-determined bilinear systems,that capture the idea of genericity, and we develop the necessary theoretical tools to estimate the complexity of the algorithms for such sequences. We also present extensive experimental results, testing our conjecture, verifying our results, and comparing the complexity of the various methods.


page 1

page 2

page 3

page 4

βˆ™ 05/30/2022

Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors

Since the seminal works of Strassen and Valiant it has been a central th...
βˆ™ 02/04/2021

Decoding Reed-Solomon codes by solving a bilinear system with a GrΓΆbner basis approach

Decoding a Reed-Solomon code can be modeled by a bilinear system which c...
βˆ™ 10/31/2019

The missing link between the output and the H_2-norm of bilinear systems

In this paper, we prove several new results that give new insights to bi...
βˆ™ 11/21/2017

Bilinear cryptography using finite p-groups of nilpotency class 2

In this short note, we develop a novel idea of a bilinear cryptosystem u...
βˆ™ 10/20/2020

Advantages of Bilinear Koopman Realizations for the Modeling and Control of Systems with Unknown Dynamics

Nonlinear dynamical systems can be made easier to control by lifting the...
βˆ™ 01/19/2022

It is undecidable whether the growth rate of a given bilinear system is 1

We show that there exists no algorithm that decides for any bilinear sys...
βˆ™ 01/07/2021

Blockchain Aided Privacy-Preserving Outsourcing Algorithms of Bilinear Pairings for Internet of Things Devices

Bilinear pairing is a fundamental operation that is widely used in crypt...