메뉴 건너뛰기




Volumn 1, Issue 1, 2007, Pages 44-49

Parallel computation of modular exponentiation for fast cryptography

Author keywords

cryptography; modular exponentiation; modular multiplication

Indexed keywords


EID: 65349181644     PISSN: 17516528     EISSN: 17516536     Source Type: Journal    
DOI: 10.1504/IJHPSA.2007.013290     Document Type: Article
Times cited : (13)

References (13)
  • 2
    • 0009399673 scopus 로고
    • Computing sequences with addition chains
    • Downey, P., Leony, B. and Sethi, R. (1981) ‘Computing sequences with addition chains’, SIAM Journal on Computing, Vol. 3, pp.638–696.
    • (1981) SIAM Journal on Computing , vol.3 , pp. 638-696
    • Downey, P.1    Leony, B.2    Sethi, R.3
  • 3
    • 3643133704 scopus 로고
    • The Z80180 and big-number arithmetic
    • Kaliski Jr., B.S. (1993) ‘The Z80180 and big-number arithmetic’, Dr. Dobb’s Journal, Vol. 50, p.58.
    • (1993) Dr. Dobb’s Journal , vol.50 , pp. 58
    • Kaliski, B.S.1
  • 5
    • 0347208304 scopus 로고
    • High-radix and bit recoding techniques for modular exponentiation
    • Koç, Ç.K. (1991) ‘High-radix and bit recoding techniques for modular exponentiation’, International Journal of Computer Mathematics, Vol. 40, Nos. 3–4, pp.139–156.
    • (1991) International Journal of Computer Mathematics , vol.40 , Issue.3-4 , pp. 139-156
    • Koç, Ç.K.1
  • 6
    • 0003683288 scopus 로고
    • Research Report, RSA Laboratories, Version 2, California, USA
    • Koç, Ç.K. (1994) High Speed RSA Implementation, Research Report, RSA Laboratories, Version 2, California, USA.
    • (1994) High Speed RSA Implementation
    • Koç, Ç.K.1
  • 7
    • 0029406556 scopus 로고
    • Analysis of sliding window techniques for exponentiation
    • Koç, Ç.K. (1995) ‘Analysis of sliding window techniques for exponentiation’, Computers and Mathematics with Applications, Vol. 30, No. 10, pp.17–24.
    • (1995) Computers and Mathematics with Applications , vol.30 , Issue.10 , pp. 17-24
    • Koç, Ç.K.1
  • 8
    • 38249008364 scopus 로고
    • Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers
    • Koç, Ç.K. and Hung, C.Y. (1992) ‘Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers’, Computers and Mathematics with Applications, Vol. 24, No. 3, pp.3–12.
    • (1992) Computers and Mathematics with Applications , vol.24 , Issue.3 , pp. 3-12
    • Koç, Ç.K.1    Hung, C.Y.2
  • 9
    • 0031651428 scopus 로고    scopus 로고
    • Window and extended window methods for addition chain and addition-subtraction chain
    • Kunihiro, N. and Yamamoto, H. (1998) ‘Window and extended window methods for addition chain and addition-subtraction chain’, IEICE Transactions, Vol. E81-A, No. 1, pp.72–81.
    • (1998) IEICE Transactions , vol.E81-A , Issue.1 , pp. 72-81
    • Kunihiro, N.1    Yamamoto, H.2
  • 10
    • 0033887804 scopus 로고    scopus 로고
    • New methods for generating short addition chain
    • Kunihiro, N. and Yamamoto, H. (2000) ‘New methods for generating short addition chain’, IEICE Transactions, Vol. E83-A, No. 1, pp.60–67.
    • (2000) IEICE Transactions , vol.E83-A , Issue.1 , pp. 60-67
    • Kunihiro, N.1    Yamamoto, H.2
  • 13
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key cryptosystems
    • Rivest, R.L., Shamir, A. and Adleman, L. (1978) ‘A method for obtaining digital signatures and public-key cryptosystems’, Communications of the ACM, Vol. 21, No. 2, pp.120–126.
    • (1978) Communications of the ACM , vol.21 , Issue.2 , pp. 120-126
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.