DeepAI AI Chat
Log In Sign Up

Efficient computation of the Jacobi symbol

by   Niels Möller, et al.

The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the Jacobi symbol, using a single table lookup per reduction. For both quadratic time GCD algorithms (Euclid, Lehmer) and subquadratic algorithms (Knuth, Schönhage, Möller), the additional cost is linear, roughly one table lookup per quotient in the quotient sequence. This method was used for the 2010 rewrite of the Jacobi symbol computation in GMP.


page 1

page 2

page 3

page 4


Speeding up the Karatsuba algorithm

This paper describes an ∼ O(n) pre-compute technique to speed up the Kar...

Cartesian trees and Lyndon trees

The article describes the structural and algorithmic relations between C...

Method and apparatus for automatic text input insertion in digital devices with a restricted number of keys

A device which contains number of symbol input keys, where the number of...

A New OFDM System for IIR Channels

In this paper, we propose a new OFDM system for an IIR channel with the ...

On Optimum Enumerative Sphere Shaping Blocklength at Different Symbol Rates for the Nonlinear Fiber Channel

We show that a 0.9 dB SNR improvement can be obtained via short-blocklen...

RIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets

RIn-Close_CVC is an efficient (take polynomial time per bicluster), comp...

A Local-Pattern Related Look-Up Table

This paper describes a Relevance-Zone pattern table (RZT) that can be us...