Analysis of Sliding Window Techniques for Exponentiation

@inproceedings{Etin1995AnalysisOS,
  title={Analysis of Sliding Window Techniques for Exponentiation},
  author={C Etin and Kaya Ko},
  year={1995}
}
The m-ary method for computing x E partitions the bits of the integer E into words of constant length, and then performs as many multiplications as there are nonzero words. Variable length partitioning strategies have been suggested to reduce the number of nonzero words, and thus, the total numb e r o f m ultiplications. Algorithms for exponentiation using such partitioning strategies are termed sliding window techniques. In this paper, we give algorithmic descriptions of two recently proposed… CONTINUE READING
Highly Cited
This paper has 147 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 59 extracted citations

A New Efficient Request-Based Comparable Encryption Scheme

2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops • 2015
View 4 Excerpts
Method Support
Highly Influenced

Information Leakage Due to Cache and Processor Architectures

View 34 Excerpts
Method Support
Highly Influenced

147 Citations

01020'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 147 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

High-radix and bit recoding techniques for modular exponentiation

C K Ko
International Journal of Computer Mathematics • 1991

Fast exponentiation with precomputation Advances in Cryptology Exponentiation using canonical recoding

F Brickell, D M Gordon, +3 authors C K Ko
Lecture Notes in Computer Science Theoretical Computer Science • 1292