메뉴 건너뛰기




Volumn 53, Issue 3, 2004, Pages 375-380

High-speed, low-complexity systolic designs of novel iterative division algorithms in GF(2m)

Author keywords

Division; Euclid's algorithm; Finite field; Stein's algorithm; Systolic array

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; DIGITAL CIRCUITS; INTEGRATED CIRCUIT LAYOUT; LOGIC GATES; POLYNOMIALS; PUBLIC KEY CRYPTOGRAPHY; SYSTOLIC ARRAYS; VECTORS; VLSI CIRCUITS;

EID: 1842530832     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2004.1261843     Document Type: Article
Times cited : (55)

References (22)
  • 5
    • 0024768980 scopus 로고
    • Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
    • Nov.
    • M. Morii, M. Kasahara, and D.L. Whiting, "Efficient Bit-Serial Multiplication and the Discrete-Time Wiener-Hopf Equation over Finite Fields," IEEE Trans. Information Theory, vol. 35, pp. 1177-1183, Nov. 1989.
    • (1989) IEEE Trans. Information Theory , vol.35 , pp. 1177-1183
    • Morii, M.1    Kasahara, M.2    Whiting, D.L.3
  • 8
    • 0000142152 scopus 로고    scopus 로고
    • m) multiplication and division over the dual basis
    • Mar.
    • m) Multiplication and Division over the Dual Basis," IEEE Trans. Computers, vol. 45, no. 3, pp. 319-327, Mar. 1996.
    • (1996) IEEE Trans. Computers , vol.45 , Issue.3 , pp. 319-327
    • Fenn, S.T.J.1    Benaissa, M.2    Taylor, D.3
  • 11
    • 0021471875 scopus 로고
    • Systolic VLSI arrays for polynomial GCD computation
    • Aug.
    • R.P. Brent and H.T. Kung, "Systolic VLSI Arrays for Polynomial GCD Computation," IEEE Trans. Computers, vol. 33, no. 8, pp. 731-736, Aug. 1984.
    • (1984) IEEE Trans. Computers , vol.33 , Issue.8 , pp. 731-736
    • Brent, R.P.1    Kung, H.T.2
  • 12
    • 0000086518 scopus 로고
    • Fast inverter over finite field based on Euclid's algorithm
    • Nov.
    • K. Araki, I. Fujita, and M. Morisue, "Fast Inverter over Finite Field Based on Euclid's Algorithm," IEICE Trans. Fundamentals, vol. E-72, pp. 1230-1234, Nov. 1989.
    • (1989) IEICE Trans. Fundamentals , vol.E-72 , pp. 1230-1234
    • Araki, K.1    Fujita, I.2    Morisue, M.3
  • 16
    • 0000585372 scopus 로고
    • Computational problems associated with Racah algebra
    • J. Stein, "Computational Problems Associated with Racah Algebra," J. Computational Physics, vol. 1, pp. 397-405, 1967.
    • (1967) J. Computational Physics , vol.1 , pp. 397-405
    • Stein, J.1
  • 17
    • 0032065068 scopus 로고    scopus 로고
    • A VLSI algorithm for modular division based on the binary GCD algorithm
    • May
    • N. Takagi, "A VLSI Algorithm for Modular Division Based on the Binary GCD Algorithm," IEICE Trans. Fundamentals, vol. E81-A, pp. 724-728, May 1998.
    • (1998) IEICE Trans. Fundamentals , vol.E81-A , pp. 724-728
    • Takagi, N.1
  • 20
    • 0035505389 scopus 로고    scopus 로고
    • An energy-efficient reconfigurable public-key cryptography processor
    • Nov.
    • J. Goodman and A.P. Chandrakasan, "An Energy-Efficient Reconfigurable Public-Key Cryptography Processor," IEEE J. Solid-State Circuits, vol. 36, pp. 1808-1820, Nov. 2001.
    • (2001) IEEE J. Solid-State Circuits , vol.36 , pp. 1808-1820
    • Goodman, J.1    Chandrakasan, A.P.2
  • 21
    • 1842598702 scopus 로고    scopus 로고
    • or http://pmc6.ee.ccu.edu.tw/papers.htm
    • http://vlsidsp.el.yuntech.edu.tw/Papers/Papers.htm or http://pmc6.ee.ccu.edu.tw/papers.htm, 2003.
    • (2003)
  • 22
    • 0003859414 scopus 로고
    • Englewood Cliffs, N.J.: Prentice Hall
    • S.Y. Kung, VLSI Array Processors. Englewood Cliffs, N.J.: Prentice Hall, 1988.
    • (1988) VLSI Array Processors
    • Kung, S.Y.1


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