Notice of RetractionA Novel Shortest Addition Chains Algorithm Based on Euclid Algorithm

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

This paper studies shortest addition chains algorithm of modular exponentiation, modifies the expression of modular exponentiation according to Euclid algorithm, transform the process of solving the shortest addition chains of a large integer into solving that of three much smaller integers, then greatly saves the time and space of the process, and ensures that the length of new shortest addition chains is as short as that of classical algorithm. Algorithm analysis and a lot of experiment results show that the new algorithm based on Euclid algorithm is more efficient than traditional algorithm of shortest addition chains.