61 citations · 445 across the 59 of their papers we have counts for
10 papers · 1 filter
Further analysis of the binary Euclidean algorithm
Richard P. Brent
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than th…
An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. Brent, Paul Zimmermann
The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Schönhage's fast continued fraction algorithm combined with an identit…
A Simple Approach to Error Reconciliation in Quantum Key Distribution
Richard P. Brent
We discuss the error reconciliation phase in quantum key distribution (QKD) and analyse a simple scheme in which blocks with bad parity (that is, blocks containing an odd number of…
Parallel algorithms in linear algebra
Richard P. Brent
This report provides an introduction to algorithms for fundamental linear algebra problems on various parallel computer architectures, with the emphasis on distributed-memory MIMD…
Modern Computer Arithmetic (version 0.5.1)
Richard P. Brent, Paul Zimmermann
This is a draft of a book about algorithms for performing arithmetic, and their implementation on modern computers. We are concerned with software more than hardware - we do not co…
Some linear-time algorithms for systolic arrays
Richard P. Brent, Franklin T. Luk, H. T. Kung
We survey some results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite fiel…