Fast algorithms for linear algebra modulo N
From MaRDI portal
Fast algorithms for linear algebra modulo \(N\)
Cited in
(20)- Modular arithmetic for linear algebra computations in the real field
- On the computation of the HNF of a module over the ring of integers of a number field
- Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings
- Efficient Gröbner bases computation over principal ideal rings
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Certified dense linear system solving
- Cryptanalysis of schemes based on pseudoinverse matrix
- Linear Approximations of Addition Modulo 2n-1
- Reduced linear modular systems
- scientific article; zbMATH DE number 3988701 (Why is no real title available?)
- Reducing ideal arithmetic to linear algebra problems
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- Computing isomorphisms between lattices
- Deterministic reduction of integer nonsingular linear system solving to matrix multiplication
- Hensel-lifting torsion points on Jacobians and Galois representations
- Computation of invariants of finite abelian groups
- Classical vs quantum satisfiability in linear constraint systems modulo an integer
- A classically efficient forgery of MPPK/DS signatures
- Powers of low rank sparse matrices
- On the complexity of inverting integer and polynomial matrices
This page was built for publication: Fast algorithms for linear algebra modulo \(N\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252030)
