Redundant representation of finite fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1992, Issue , 2001, Pages 339-352

  Geiselmann, Willi ^a   Lukhaub, Harald ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTATION THEORY;

CYCLIC SHIFTS; EXPONENTIATIONS; FINITE FIELDS; LOW-POWER COMPUTING; NORMAL BASIS; REDUNDANT REPRESENTATION; REVERSIBLE GATES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 34147192399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_25     Document Type: Conference Paper

References (16)

1. ElGamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans.Inform.Theory, IT-31, 469-472
2. 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.
3. 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.
4. Bennet, C.H. (1982). The thermodynamics of computation – a rev iew. International Journal of Theoretical Physics, 21, 12, 905–940.
5. Beth, T., Gollmann, D. (1989). Algorithm Engineering for Public Key Algorithms. IEEE JSAC, 7, 458–466.
6. n). Proc. of Auscrypt’90, Seberry, J., Pieprzyk, J. (eds.), Springer LNCS 453, 398–405.
7. Haining, F.; Simple multiplication algorithms for a class of GF(2n). Electronics Letters, 28th March 1996; Vol 32, No 7, 636–637.
8. 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.
9. Kocher, P., Jaffe, J., Jun, B. (1999). Differential Power Analysis. Advances in Cryptology - CRYPTO’99, Wiener, M. (ed.). Springer, LNCS 1666, 388–397.
10. 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.
11. Massey, J.L., Omura, J.K. (1981). Computational method and apparatus for finite field arithmetic. U.S. Patent application.
12. Merkle, R.C. (1993). Reversible electronic logic using switches. Nanotechnology, 4, 21–40.
13. n). Discrete Applied Mathematics, 22, 149–161.
14. Berlekamp, E.R. (1982). Bit-Serial Reed-Solomon Encoders. IEEE Trans.Inf.Th., IT-28, 869–874.
15. Lidl, R., Niederreiter, H. (1986). Introduction to Finite Fields and Their Applications. Cambridge University Press.
16. MacWilliams, F.J., Sloane, N.J.A. (1977). The Theory of Error-Correcting Codes. North Holland.