메뉴 건너뛰기




Volumn 46, Issue 2, 1997, Pages 139-141

Space/time trade-offs for higher radix modular multiplication using repeated addition

Author keywords

Computer arithmetic; Cryptography; Higher radix; Modular multiplication; Optimal speed; Redundant number systems; RSA

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; CRYPTOGRAPHY; NUMBER THEORY; PARALLEL PROCESSING SYSTEMS; SHIFT REGISTERS;

EID: 0031076815     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.565588     Document Type: Article
Times cited : (28)

References (8)
  • 1
    • 84976738616 scopus 로고
    • The Area-Time Complexity of Binary Multiplication
    • R.P. Brent and H.T. Kung, "The Area-Time Complexity of Binary Multiplication," J. ACM, vol. 28, pp. 521-534, 1981.
    • (1981) J. ACM , vol.28 , pp. 521-534
    • Brent, R.P.1    Kung, H.T.2
  • 2
    • 0020900943 scopus 로고
    • A Fast Modular Multiplication Algorithm with Application to Two-Key Cryptography
    • Chaum et al., eds., New York: Plenum
    • E.F. Brickell, "A Fast Modular Multiplication Algorithm with Application to Two-Key Cryptography," Advances in Cryptology - CRYPTO '82, Chaum et al., eds., pp. 51-60. New York: Plenum, 1983.
    • (1983) Advances in Cryptology - CRYPTO '82 , pp. 51-60
    • Brickell, E.F.1
  • 3
    • 0020929632 scopus 로고
    • Recursive Implementation of Optimal Time VLSI Integer Multipliers
    • F. Anceau and E.J. Aas, eds. Elsevier Science
    • W.K. Luk and J.E. Vuillemin, "Recursive Implementation of Optimal Time VLSI Integer Multipliers," Proc. VLSI '83, F. Anceau and E.J. Aas, eds. Elsevier Science, 1983.
    • (1983) Proc. VLSI '83
    • Luk, W.K.1    Vuillemin, J.E.2
  • 4
    • 0020780067 scopus 로고
    • Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
    • K. Mehlhorn and F.P. Preparata, "Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time," Information and Control, vol. 58, pp. 137-156, 1983.
    • (1983) Information and Control , vol.58 , pp. 137-156
    • Mehlhorn, K.1    Preparata, F.P.2
  • 5
    • 84966243285 scopus 로고
    • Modular Multiplication without Trial Division
    • P.L. Montgomery, "Modular Multiplication without Trial Division," Math. Computation, vol. 44, pp. 519-521, 1985.
    • (1985) Math. Computation , vol.44 , pp. 519-521
    • Montgomery, P.L.1
  • 6
    • 0017930809 scopus 로고
    • A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
    • R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.
    • (1978) Comm. ACM , vol.21 , pp. 120-126
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3
  • 7
    • 0009458561 scopus 로고
    • Faster Modular Multiplication by Operand Scaling
    • Advances in Cryptology - CRYPTO '91, Springer-Verlag
    • C.D. Walter, "Faster Modular Multiplication by Operand Scaling," Advances in Cryptology - CRYPTO '91, Lecture Notes in Computer Science, vol. 576, pp. 313-323. Springer-Verlag, 1992.
    • (1992) Lecture Notes in Computer Science , vol.576 , pp. 313-323
    • Walter, C.D.1
  • 8
    • 0027606916 scopus 로고
    • Hardware Implementation of Montgomery's Modular Multiplication Algorithm
    • June
    • C.D. Walter and S.E. Eldridge, "Hardware Implementation of Montgomery's Modular Multiplication Algorithm," IEEE Trans. Computers, vol. 42, no. 6, pp. 693-699, June 1993.
    • (1993) IEEE Trans. Computers , vol.42 , Issue.6 , pp. 693-699
    • Walter, C.D.1    Eldridge, S.E.2


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