M4RI
From MaRDI portal
Cited in
(40)- GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\)
- SM4
- Obtaining and solving systems of equations in key variables only for the small variants of AES
- Speeding up the GVW algorithm via a substituting method
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
- Fast matrix decomposition in \(\mathbb F_2\)
- Computing border bases using mutant strategies
- On self-equivalence encodings in white-box implementations
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Algorithm 898
- Formal languages over GF(2)
- The inverse of \(\chi\) and its applications to Rasta-like ciphers
- Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2
- An improvement over the GVW algorithm for inhomogeneous polynomial systems
- On the arithmetic complexity of Strassen-like matrix multiplications
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- FFLAS-FFPACK
- Cryptanalysis of the binary permuted kernel problem
- AIDA
- M4RIE
- GBLA
- An algebraic attack on rank metric code-based cryptosystems
- Algorithm 898
- MayBMS
- SLV
- GF2toolkit
- LowMC
- F5C
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting
- Ciminion
- Durandal
- tinygb
- MXL3
- MutantXL
- Construction of the irreducible modular representations of a finite group
- Flexible constrained sampling with guarantees for pattern mining
- The M4RIE library for dense linear algebra over small fields with even characteristic
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
This page was built for software: M4RI
