Distributed and secure linear algebra – Master Thesis

11/12/2022
by   Hugo Mirault, et al.
0

Cryptography is the discipline that allows securing of the exchange of information. In this internship, we will focus on a certain branch of this discipline, secure computation in a network. The main goal of this internship, illustrated in this report, is to adapt a roster of protocols intended to do linear algebra. We want to adapt them to do algebra for matrices with polynomial coefficients. We then wish to make a complete analysis of the different complexities of these protocols.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2020

A Closer Look at the Tropical Cryptography

We examine two public key exchange protocols proposed recently by Grigor...
research
07/03/2018

Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations

We design and analyze new protocols to verify the correctness of various...
research
07/03/2018

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication

We develop and analyze new protocols to verify the correctness of variou...
research
10/21/2018

PQC: Triple Decomposition Problem Applied To GL(d, Fp) - A Secure Framework For Canonical Non-Commutative Cryptography

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols...
research
08/21/2021

Beyond Linear Algebra

Our title challenges the reader to venture beyond linear algebra in desi...
research
03/22/2021

A Succinct Multivariate Lazy Multivariate Tower AD for Weil Algebra Computation

We propose a functional implementation of Multivariate Tower Automatic D...
research
02/16/2019

A linear complexity analysis of quadratic residues and primitive roots spacings

We investigate the linear complexities of the periodic 0-1 infinite sequ...

Please sign up or login with your details

Forgot password? Click here to reset