Exponentiation By Squaring - Euclidean Method

Euclidean Method

The Euclidean method was first introduced in 'Efficient exponentiation using precomputation and vector addition chains' by P.D Rooij. The algorithm below computes xn using the following equality recursively

where q=

Given the element x in G and the exponent 'n' written as in Yao's method with the pre computed values xb0....xbl-1 the element xn is calculated using the algorithm below

  1. while true do
  2. Find M such that nM ≥ ni for all i in
  3. Find N ≠ M such that nN ≥ ni for all i in, i ≠ M
  4. if nN ≠ 0 then
  5. q= (nM/nN), xN=xMq·xN and nM=nN mod nN
  6. else break
  7. return xMnM

The algorithm first finds the largest value amongst the ni and then the supremum within the set of {ni : i ≠ M }. It raises xM to the power q, multiplies this value with xN, and then assigns xN the result of this computation and nM the value nM modulo nN.

Read more about this topic:  Exponentiation By Squaring

Famous quotes containing the word method:

    “Protestantism has the method of Jesus with His secret too much left out of mind; Catholicism has His secret with His method too much left out of mind; neither has His unerring balance, His intuition, His sweet reasonableness. But both have hold of a great truth, and get from it a great power.”
    —Matthew Arnold (1822–1888)