메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 400-404

Very high radix scalable montgomery multipliers

Author keywords

[No Author keywords available]

Indexed keywords

MODULAR EXPONENTIATION; MONTGOMERY MULTIPLIERS;

EID: 33748890858     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWSOC.2005.111     Document Type: Conference Paper
Times cited : (19)

References (13)
  • 1
    • 0035390239 scopus 로고    scopus 로고
    • High-radix Montgomery multiplication on reconfigurable hardware
    • July
    • T. Blum and C. Paar, "High-radix Montgomery multiplication on reconfigurable hardware," IEEE Trans, Computers, vol. 50, no. 7, July 2001, pp. 759-764.
    • (2001) IEEE Trans, Computers , vol.50 , Issue.7 , pp. 759-764
    • Blum, T.1    Paar, C.2
  • 2
    • 85034490362 scopus 로고
    • A cryptographic library for the Motorola DSP56000
    • Lecture Notes in Computer Science, I. B. Damgaard, ed., Springer-Verlag, New York
    • S. Dusse and B. Kaliski, "A cryptographic library for the Motorola DSP56000," Eurocrypt 90, Lecture Notes in Computer Science, No. 473, I. B. Damgaard, ed., Springer-Verlag, New York, 1990, pp. 230-244.
    • (1990) Eurocrypt , vol.90 , Issue.473 , pp. 230-244
    • Dusse, S.1    Kaliski, B.2
  • 3
    • 49549115868 scopus 로고    scopus 로고
    • An improved unified scalable radix-2 Montgomery multiplier
    • submitted to
    • D. Harris et al., "An improved unified scalable radix-2 Montgomery multiplier", submitted to IEEE Symp. Computer Arithmetic, 2005.
    • (2005) IEEE Symp. Computer Arithmetic
    • Harris, D.1
  • 4
    • 0030172012 scopus 로고    scopus 로고
    • Analyzing and comparing Montgomery multiplication algorithms
    • June
    • Ç. Koç, T. Acar, B. Kaliski, "Analyzing and comparing Montgomery multiplication algorithms," IEEE Micro, June 1996, pp. 26-33.
    • (1996) IEEE Micro , pp. 26-33
    • Koç, Ç.1    Acar, T.2    Kaliski, B.3
  • 5
    • 84966243285 scopus 로고
    • Modular multiplication without trial division
    • April
    • P. Montgomery, "Modular multiplication without trial division, " Math. Of Computation, vol. 44, no. 170, pp. 519-521, April 1985.
    • (1985) Math. of Computation , vol.44 , Issue.170 , pp. 519-521
    • Montgomery, P.1
  • 6
    • 4644232920 scopus 로고    scopus 로고
    • Design of high-speed and area-efficient Montgomery modular multiplier for RSA algorithm
    • K. Mukaida, M. Takenaka, N. Torii, and S. Masui, "Design of high-speed and area-efficient Montgomery modular multiplier for RSA algorithm," IEEE Symp. VLSI Circuits, pp. 320-323, 2004.
    • (2004) IEEE Symp. VLSI Circuits , pp. 320-323
    • Mukaida, K.1    Takenaka, M.2    Torii, N.3    Masui, S.4
  • 9
    • 0141831855 scopus 로고    scopus 로고
    • A scalable architecture for modular multiplication based on Montgomery's algorithm
    • Sept.
    • A. Tenca and Ç. Koç, "A scalable architecture for modular multiplication based on Montgomery's algorithm," IEEE Trans. Computers, vol. 52, no.9, Sept. 2003, pp. 1215-1221.
    • (2003) IEEE Trans. Computers , vol.52 , Issue.9 , pp. 1215-1221
    • Tenca, A.1    Koç, Ç.2
  • 10
    • 4143116646 scopus 로고    scopus 로고
    • An efficient and scalable radix-4 modular multiplier design using reciding techniques
    • A. Tenca and L. Tawalbeh, "An efficient and scalable radix-4 modular multiplier design using reciding techniques," Proc Asilomar Conf. Signals, Systems, and Computers, pp. 1445-1450, 2003.
    • (2003) Proc Asilomar Conf. Signals, Systems, and Computers , pp. 1445-1450
    • Tenca, A.1    Tawalbeh, L.2
  • 11
    • 4243316897 scopus 로고    scopus 로고
    • M.S. Thesis, Worcester Polytechnic Institute, Dept of Electrical Engineering, April
    • G. Gaubatz, "Versatile Montgomery multiplier architectures," M.S. Thesis, Worcester Polytechnic Institute, Dept of Electrical Engineering, April 2002.
    • (2002) Versatile Montgomery Multiplier Architectures
    • Gaubatz, G.1


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