Analysis of the sliding window powering algorithm

14Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

Abstract

We analyze precisely the parameters entering the sliding window powering method, and apply this to the case of an elliptic curve over a large finite prime field. © 2004 Internation Association for cryptologic Research.

Cite

CITATION STYLE

APA

Cohen, H. (2005). Analysis of the sliding window powering algorithm. Journal of Cryptology, 18(1), 63–76. https://doi.org/10.1007/s00145-004-0218-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free