Welcome to the resource topic for
**2023/448**

**Title:**

Generalized Inverse Matrix Construction for Code Based Cryptography

**Authors:**
Farshid Haidary Makoui, T. Aaron Gulliver

**Abstract:**

The generalized inverses of systematic non-square binary matrices have applications in mathematics, channel coding and decoding, navigation signals, machine learning, data storage and cryptography such as the McEliece and Niederreiter public-key cryptosystems.

A systematic non-square (n-k) \times k matrix H, n > k, has 2^{k\times(n-k)} different generalized inverse matrices.

This paper presents an algorithm for generating these matrices and compares it with two well-known methods, i.e. Gauss-Jordan elimination and Moore-Penrose methods. A random generalized inverse matrix construction method is given which has a lower execution time than the Gauss-Jordan elimination and Moore-Penrose approaches.

**ePrint:**
https://eprint.iacr.org/2023/448

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .