Abstract
In many of cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its hardware implementation may require millions of logic gates. It is a complex and costly task to develop such large finite field multipliers which will always yield error free outputs. In this effect, this paper considers fault tolerant multiplication in finite fields. It deals with detection of errors of bit-parallel and bit-serial polynomial basis multipliers over finite fields of characteristic two. Our approach is to partition the multiplier structure into a number of smaller computational units and use the parity prediction technique to detect errors.
Chapter PDF
Similar content being viewed by others
References
G. B. Agnew, T. Beth, R. C. Mullin, and S. A. Vanstone. “Arithmetic Operations in GF(2m)”. Journal of Cryptology, 6:3–13, 1993.
D. Boneh, R. A. DeMillo, and R. J. Lipton. “On the Importance of Eliminating Errors in Cryptographic Computations”. Journal of Cryptology, 14:101–119, 2001.
S. Fenn, M. Gossel, M. Benaissa, and D. Taylor. “On-Line Error Detection for Bit-Serial Multipliers in GF(2m)”. Journal of Electronic Testing: Theory and Applications, 13:29–40, 1998.
A. Halbutogullari and C. K. Koc. “Mastrovito Multiplier for General Irreducible Polynomials”. IEEE Transactions on Computers, 49(5):503–518, May 2000.
M. Joye, A. K. Lenstra, and J. J. Quisquater. “Chinese Remaindering Based Cryptosystems in the Presence of Faults”. Journal of Cryptology, 12:241–245, 1999.
P. K. Lala. Fault Tolerant and Fault Testable Hardware Design. Prentice Hall, 1985.
E. D. Mastrovito. VLSI Architectures for Computation in Galois Fields. PhD thesis, Linkoping Univ., Linkoping Sweden, 1991.
C. Paar, P. Fleishmann, and P. Soria-Rodriguez. “Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents”. IEEE Transactions on Computers, 48(10):1025–1034, Oct. 1999.
A. Reyhani-Masoleh and M. A. Hasan. “A New Eficient Architecture of Mastrovito Multiplier over GF(2m)”. In 20th Biennial Symposium on Communications, pages 59–63, Kingston, Ontario, Canada, May 2000.
H. Wu and M. A. Hasan. “Efficient Exponentiation of a Primitive Root in GF(2m)”. IEEE Transactions on Computers, 46(2):162–172, Feb. 1997.
T. Zhang and K. K. Parhi. “Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials”. IEEE Transactions on Computers, 50(7):734–748, July 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reyhani-Masoleh, A., Hasan, M. (2003). Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. In: Kaliski, B.S., Koç, ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems - CHES 2002. CHES 2002. Lecture Notes in Computer Science, vol 2523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36400-5_37
Download citation
DOI: https://doi.org/10.1007/3-540-36400-5_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00409-7
Online ISBN: 978-3-540-36400-9
eBook Packages: Springer Book Archive