FAST HYBRID ALGORITHM FOR KRONECKER SYMBOL COMPUTATION
Abstract
In this study, we obtain a new hybrid algorithm that quickly computes the Kronecker symbol [2, 3]. This type of algorithm uses arithmetic operations “remainder” and “subtraction”. Our goal is also to generalize iteration process for Jacobi symbol calculations, which is the subject of many serious researchers [1], [4]–[8]. The numbers that are not long and are not of ordinary length need special attention and care, which is provided by hybrid algorithms.
Refbacks
- There are currently no refbacks.