Improved normal basis inversion in GF(2m)

Electronics Letters

Volumn 33, Issue 3, 1997, Pages 196-197

  Yen, Sung Ming ^a  

^a DA YEH UNIVERSITY   (Taiwan)

Author keywords

BCH codes; Decoding; Galois fields; Number theoretic transforms; Reed solomon codes

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; NUMBER THEORY; NUMERICAL METHODS;

FERMAT THEOREM; GALOIS FIELDS; REED-SOLOMON CODES;

ALGORITHMS;

EID: 0030783572     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19970172     Document Type: Article

References (9)

1. MacWILLIAMS, F.J., and SLOANE, N.J.A.: 'The theory of error-correcting codes' (North Holland, New York, 1977)
2. m)', Electron. Lett., 1996, 32, (17), pp. 1566-1567
3. FENN, S.T.J., BENAISSA, M., and TAYLOR, D.: 'Finite field inversion over the dual basis', IEEE Trans. VLSI Systems, 1996, 4, (1), pp. 134-137
4. m)', IEEE Trans., 1985, C-34, (8), pp. 709-717
5. KNUTH, D.E.: 'The art of computer programming. Vol. II: Seminumerical algorithms' (Addison-Wesley, MA, 1969)
6. LOU, D.C., and CHANG, C.C.: 'Fast exponentiation method obtained by folding the exponent in half', Electron. Lett., 1996, 32, (11), pp. 984-985
7. WU, T.C., and CHANG, Y.S.: 'Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih', Electron. Lett., 1995, 31, (20), pp. 1738-1739
8. YEN, S.M., and LAIH, C.S.: 'Common-multiplicand multiplication and its applications to public key cryptography', Electron. Lett., 1993, 29, (17), pp. 1583-1584
9. YEN, S.M.: 'Improved common-multiplicand multiplication and fast exponentiation by exponent decomposition'. Technical Report, Da-Yeh Institute of Technology, Republic of China, 1996