Simple multiplication algorithm for a class of GF(2n)

Electronics Letters

Volumn 32, Issue 7, 1996, Pages 636-637

  Haining, Fan ^a  

^a INSTITUTE OF COMMUNICATIONS ENGINEERING   (China)

Author keywords

Combinatorial mathematics; Digital arithmetic; Number theory

Indexed keywords

ALGORITHMS; CALCULATIONS; COMBINATORIAL MATHEMATICS; COMPUTER HARDWARE; COMPUTER SOFTWARE; DIGITAL ARITHMETIC; POLYNOMIALS; THEOREM PROVING; VECTORS;

ALL ONE POLYNOMIAL; MULTIPLICATIONS PER SECOND; NONNEGATIVE RESIDUE; OPTIMAL NORMAL BASIS; PARALLEL MULTIPLIERS; SIMPLE MULTIPLICATION ALGORITHM;

NUMBER THEORY;

EID: 0030108074     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19960416     Document Type: Article

References (5)

1. HASAN, M.A., WANG, M.Z., and BHARGAVA, V.K.: 'A modified Massey-Omura parallel multiplier for a class of finite fields', IEEE Trans. Comput., 1993, 42, (10), pp. 1278-1280
2. n)', IEEE Trans. Comput., 1992, 41, (8), pp. 962-971
3. n)', Discrete Appl. Math., 1988/89, 22, pp. 149-161
4. ZHEXIAN WAN: 'Algebra and coding' (Science Press, Beijing, 1980), pp. 87-88
5. n)', Math. Comput., 1993, 60, (201), pp. 407-420