A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
type: Item
instance of: scholarly article
title: A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
zbMATH Open document ID: None
author: M. A. Cherepniov
published in: Journal of Mathematical Sciences (New York)
publication date: 2013-11-04T00:00:00Z
Mathematics Subject Classification ID: 65Fxx
Mathematics Subject Classification ID: 15-XX
zbMATH DE Number: 6222141
MaRDI profile type: Publication
full work available at URL: s10958-013-1489-0
OpenAlex ID: W2011996063
cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
cites work: A block algorithm of Lanczos type for solving sparse systems of linear equations
cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
cites work: Q4660659
cites work: Asymptotically fast polynomial matrix algorithms for multivariable systems
cites work: Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
cites work: Factorization of a 768-Bit RSA Modulus
cites work: Q2757235
cites work: Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
DOI: 10.1007/S10958-013-1489-0
Recommended article: On the bit-complexity of sparse polynomial and series multiplication
Recommended article: Improving complexity bounds for the computation of Puiseux series over finite fields
Recommended article: A generalization of the Halász-Montgomery method
Recommended article: An approach to an arithmetic analog of Berlekamp's algorithm (Corresp.)
Recommended article: On quadratic approximations in block ciphers
Recommended article: REMARKS ON THE ALGORITHMS OF CORNACCHIA AND HERMITE-SERRET
Recommended article: Q3202941
Recommended article: On the complexity of computing Kronecker coefficients
Recommended article: On the k-error linear complexity of cyclotomic sequences
Recommended article: A Parallel and Uniform $k$-Partition Method for Montgomery Multiplication
description: scientific article; zbMATH DE number 6222141