Abstract
A redundant representation of finite fields with 2n elements is presented. It unifies the advantages of polynomial and normal bases by the cost of redundancy. The arithmetic, especially exponentiation, in this representation is perfectly suited for low power computing: multiplication can be built up with reversible gates very efficient and squaring is a cyclic shift.
Chapter PDF
Similar content being viewed by others
References
ElGamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans.Inform.Theory, IT-31, 469–472
Odlyzko, A.M. (1985). Discrete logarithms in finite fields and their cryptographic significance. Proc. of Eurocrypt’84, T. Beth, N. Cot, I. Ingemarsson (eds.), Springer LNCS 209, 224–314.
Agnew, G.B., Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A. (1991). An Implementation for a Fast Public Key Cryptosystem. Journal of Cryptology, 3, 63–79.
Bennet, C.H. (1982). The thermodynamics of computation-a rev iew. International Journal of Theoretical Physics, 21, 12, 905–940.
Beth, T., Gollmann, D. (1989). Algorithm Engineering for Public Key Algorithms. IEEE JSAC, 7, 458–466.
Geiselmann, W., Gollmann, D. (1990). VLSI design for exponentiation in GF(2n). Proc. of Auscrypt’90, Seberry, J., Pieprzyk, J. (eds.), Springer LNCS 453, 398–405.
Haining, F.; Simple multiplication algorithms for a class of GF(2n). Electronics Letters, 28th March 1996; Vol 32, No 7, 636–637.
Hsu, I.S., Truong, T.K., Deutsch, L.J., Reed, I.S. (1988).A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases.IEEE Trans. Comp., C-37, 735–739.
Kocher, P., Jaffe, J., Jun, B. (1999). Differential Power Analysis. Advances in Cryptology-CRYPTO’99, Wiener, M. (ed.). Springer, LNCS 1666, 388–397.
Koller, C.G., Athas, W.C., (1993). Adiabatic Switching, Low Energy Computing, and the Physics of Storing and Erasing Information. Proceedings of the Workshop on Physics and Computation, PhysCmp’ 92, IEEE Press.
Massey, J.L., Omura, J.K. (1981). Computational method and apparatus for finite field arithmetic. U.S. Patent application.
Merkle, R.C. (1993). Reversible electronic logic using switches. Nanotechnology, 4, 21–40.
Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A., Wilson, R.M. (1988) Optimal Normal Bases in GF(pn). Discrete Applied Mathematics, 22, 149–161.
Berlekamp, E.R. (1982). Bit-Serial Reed-Solomon Encoders. IEEE Trans.Inf.Th., IT-28, 869–874.
Lidl, R., Niederreiter, H. (1986). Introduction to Finite Fields and Their Applications. Cambridge University Press.
MacWilliams, F.J., Sloane, N.J.A. (1977). The Theory of Error-Correcting Codes. North Holland.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geiselmann, W., Lukhaub, H. (2001). Redundant Representation of Finite Fields. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_25
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive