scientific article; zbMATH DE number 503245
From MaRDI portal
Publication:4279567
zbMath0786.65028MaRDI QIDQ4279567
B. A. LaMacchia, Andrew M. Odlyzko
Publication date: 7 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lanczos methodfinite fieldsconjugate gradient methodlarge sparse linear systemsstructured Gaussian eliminationimplementationslinear algebra algorithms
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs, Index calculus in the trace zero variety, Cache Optimized Solution for Sparse Linear System over Large Order Finite Field, Solving sparse linear systems of equations over finite fields using bit-flipping algorithm, Discrete logarithm problem using index calculus method, Computation of discrete logarithms in prime fields, Computational problems in the theory of finite fields, Finding linearly generated subsequences, The Factorization of the Ninth Fermat Number, An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic, On the cubic sieve method for computing discrete logarithms over prime fields, Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III, Updating key size estimations for pairings, The Function Field Sieve in the Medium Prime Case, Unnamed Item, Indiscreet logarithms in finite fields of small characteristic, Theory and applications of Raptor codes, Factoring with Two Large Primes, Block-Krylov techniques in the context of sparse-FGLM algorithms, Fast matrix decomposition in \(\mathbb F_2\), Using number fields to compute logarithms in finite fields, Computation of a 30750-bit binary field discrete logarithm, Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле, Sparse Gaussian Elimination Modulo p: An Update, Fast scalable construction of ([compressed static | minimal perfect hash) functions], A new efficient algorithm for computing Gröbner bases \((F_4)\), Solving linear equations over GF(2): Block Lanczos algorithm, Recognizing badly presented \(Z\)-modules, Cohomology of congruence subgroups of \(\text{SL}_4(\mathbb Z)\)
