A search of minimal key functions for normal basis multipliers

IEEE Transactions on Computers

Volumn 46, Issue 5, 1997, Pages 588-592

  Lu, Chung Chin ^a,b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b IEEE   (Taiwan)

Author keywords

Coding; Cryptography; Finite field; Multiplier; Normal basis

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ENCODING (SYMBOLS); MATHEMATICAL MODELS;

MASSEY-OMURA NORMAL BASIS MULTIPLIERS; MINIMAL KEY FUNCTIONS;

MULTIPLYING CIRCUITS;

EID: 0031369480     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.589230     Document Type: Article

References (8)

1. E.R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
2. W.W. Peterson and E.J. Weldon Jr., Error-Correcting Codes, second edition. Cambridge, Mass.: MIT Press, 1972.
3. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North Holland, 1977.
4. S. Lin and D.J. Costello Jr., Error Control Coding. Englewood Cliffs, N.J.: Prentice Hall, 1983.
5. D.E.R. Denning, Cryptography and Data Security. Reading, Mass.: Addison-Wesley, 1983.
6. J.L. Massey and J.K. Omura, "Computational Method and Apparatus for Finite Field Arithmetic," U.S. Patent.
7. m)," IEEE Trans. Computers, vol. 34, pp. 709-717, Aug. 1985.
8. R. Lidl and H. Niederreiter, Finite Fields Reading, Mass.: Addison-Wesley, 1983.