Analysis of sliding window techniques for exponentiation
作者： C.K. Koç
DOI: 10.1016/0898-1221(95)00153-P
关键词: Mathematics 、 Markov chain 、 Partition (number theory) 、 Exponentiation 、 Variable length 、 Markov process 、 Analysis of algorithms 、 Algorithm 、 Sliding window protocol
摘要: … We will analyze two sliding window partitioning strategies which have been proposed in [1,6]. These methods differ in that the length of a nonzero window can be either constant (= d), …
elsevier.com
sci-hub.se 参考文章(9)
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David B. Wilson, Fast exponentiation with precomputation theory and application of cryptographic techniques. pp. 200- 207 ,(1992) , 10.1007/3-540-47555-9_18
Jurjen Bos, Matthijs Coster, Addition chain heuristics international cryptology conference. pp. 400- 407 ,(1989) , 10.1007/0-387-34805-0_37
Donald E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms ,(1981)
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
Ömer Eǧecioǧlu, Çetin Kaya Koç, Exponentiation using canonical recoding Theoretical Computer Science. ,vol. 129, pp. 407- 417 ,(1994) , 10.1016/0304-3975(94)90037-X
Çetin K. Koç, High-radix and bit recoding techniques for modular exponentiation International Journal of Computer Mathematics. ,vol. 40, pp. 139- 156 ,(1991) , 10.1080/00207169108804009
Taher ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms international cryptology conference. ,vol. 31, pp. 10- 18 ,(1985) , 10.1109/TIT.1985.1057074
Y. Yacobi, Exponentiating faster with addition chains theory and application of cryptographic techniques. pp. 222- 229 ,(1991) , 10.1007/3-540-46877-3_20
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 21, pp. 120- 126 ,(1978) , 10.1145/359340.359342