Euclid’s algorithm and the Lanczos method over finite fields

DOI10.1090/S0025-5718-98-00973-9zbMath1036.11537MaRDI QIDQ4210963

Jeremy T. Teitelbaum

Publication date: 10 September 1998

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

Lanczos methodfinite fieldssparse linear systemsself-orthogonalityEuclidean algorithm for polynomials

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Related Items

Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Cohomology of congruence subgroups of \(\text{SL}_4(\mathbb Z)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Solving linear equations over GF(2): Block Lanczos algorithm
• Solving sparse linear equations over finite fields
• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems