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.
Author supplied keywords
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? Sign in
Sign up for free