Fast matrix decomposition in \(\mathbb F_2\)
From MaRDI portal
Publication:2511223
DOI10.1016/j.cam.2013.10.026zbMath1293.65067arXiv1209.5198OpenAlexW2037927451MaRDI QIDQ2511223
Anna Rimoldi, Enrico Bertolazzi
Publication date: 5 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5198
linear algebramatrix decompositionrank computationmathematical tools for cryptographysoftware implementation of finite field arithmetic
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A-priori upper bounds for the set covering problem ⋮ Uniquely pressable graphs: characterization, enumeration, and recognition
Uses Software
Cites Work
- Matrix multiplication via arithmetic progressions
- Computation of discrete logarithms in prime fields
- Solving linear equations over GF(2): Block Lanczos algorithm
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- The Magma algebra system. I: The user language
- The Schur complement and its applications
- Generalized inverses. Theory and applications.
- Integer factoring
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- On the complexity of matrix reduction over finite fields
- \(\mathbb F _2 \) Lanczos revisited
- Determination of the inertia of a partitioned Hermitian matrix
- Gaussian elimination is not optimal
- On the computational power of pushdown automata
- On multiplication of 2 \(\times\) 2 matrices
- Algorithm 898
- Factoring Large Numbers with a Quadratic Sieve
- Solving sparse linear equations over finite fields
- LAPACK Users' Guide
- An Approximate Probabilistic Model for Structured Gaussian Elimination
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Exploiting fast matrix multiplication within the level 3 BLAS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast matrix decomposition in \(\mathbb F_2\)