메뉴 건너뛰기




Volumn E80-A, Issue 6, 1997, Pages 1160-1163

Improved common-multiplicand multiplication and fast exponentiation by exponent decomposition

Author keywords

Arithmetic algorithm; Exponentiation; Multiplication; Public key cryptography

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CRYPTOGRAPHY;

EID: 0031167702     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (16)

References (11)
  • 1
    • 0027650333 scopus 로고
    • Common-multiplicand multiplication and its applications to public key cryptography
    • S.M. Yen and C.S. Laih, "Common-multiplicand multiplication and its applications to public key cryptography," Electronics Letters, vol.29, no.17, pp.1583-1584, 1993.
    • (1993) Electronics Letters , vol.29 , Issue.17 , pp. 1583-1584
    • Yen, S.M.1    Laih, C.S.2
  • 3
    • 0017018484 scopus 로고
    • New directions in cryptography
    • W. Diffie and M.E. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory, vol.IT-22, pp.644-654, 1976.
    • (1976) IEEE Trans. Inf. Theory , vol.IT-22 , pp. 644-654
    • Diffie, W.1    Hellman, M.E.2
  • 4
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key cryptosystem
    • R.L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystem," Commun. ACM, vol.21, pp.120-126, 1978.
    • (1978) Commun. ACM , vol.21 , pp. 120-126
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3
  • 5
    • 0000758345 scopus 로고
    • A proposed Federal Information Processing Standard for digital signature standard (DSS)
    • 31 Aug.
    • National Institute of Standards and Technology, "A proposed Federal Information Processing Standard for digital signature standard (DSS)," Federal Register, vol.56, no.169, pp.42980-42982, 31 Aug. 1991.
    • (1991) Federal Register , vol.56 , Issue.169 , pp. 42980-42982
  • 6
    • 0029368578 scopus 로고
    • Improved generalization common-multiplicand multiplications algorithm of Yen and Laih
    • T.C. Wu and Y.S. Chang, "Improved generalization common-multiplicand multiplications algorithm of Yen and Laih," Electronics Letters, vol.31, no.20, pp.1738-1739, 1995.
    • (1995) Electronics Letters , vol.31 , Issue.20 , pp. 1738-1739
    • Wu, T.C.1    Chang, Y.S.2
  • 7
    • 0030143030 scopus 로고    scopus 로고
    • Fast exponentiation method obtained by folding the exponent in half
    • D.C. Lou and C.C. Chang, "Fast exponentiation method obtained by folding the exponent in half," Electronics Letters, vol.32, no.11, pp.984-985, 1996.
    • (1996) Electronics Letters , vol.32 , Issue.11 , pp. 984-985
    • Lou, D.C.1    Chang, C.C.2
  • 8
    • 85027102830 scopus 로고    scopus 로고
    • Further study on the common-multiplicand multiplication
    • Dept. of Electrical Engineering, Da-Yeh Institute of Technology, Republic of China
    • S.M. Yen, "Further study on the common-multiplicand multiplication," Technical Report, Dept. of Electrical Engineering, Da-Yeh Institute of Technology, Republic of China, 1996.
    • (1996) Technical Report
    • Yen, S.M.1
  • 9
    • 0024715942 scopus 로고
    • Minimum weight modified signed-digit representations and fast exponentiation
    • Aug.
    • J. Jedwab and C.J. Mitchell, "Minimum weight modified signed-digit representations and fast exponentiation," Electronics Letters, vol.25, no.17, pp.1171-1172, Aug. 1989.
    • (1989) Electronics Letters , vol.25 , Issue.17 , pp. 1171-1172
    • Jedwab, J.1    Mitchell, C.J.2


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