M4RI

swMATH534MaRDI QIDQ13289FDOQ13289

Author name not available (Why is that?)

Cited In (24)

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

This page was built for software: M4RI