{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:34:01Z","timestamp":1742996041772,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416586"},{"type":"electronic","value":"9783540445869"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44586-2_25","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T02:53:49Z","timestamp":1191725629000},"page":"339-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Redundant Representation of Finite Fields"],"prefix":"10.1007","author":[{"given":"Willi","family":"Geiselmann","sequence":"first","affiliation":[]},{"given":"Harald","family":"Lukhaub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,5]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans.Inform.Theory, IT-31, 469\u2013472","journal-title":"IEEE Trans.Inform.Theory"},{"key":"25_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Discrete logarithms in finite fields and their cryptographic significance","author":"A.M. Odlyzko","year":"1985","unstructured":"Odlyzko, A.M. (1985). Discrete logarithms in finite fields and their cryptographic significance. Proc. of Eurocrypt\u201984, T. Beth, N. Cot, I. Ingemarsson (eds.), Springer LNCS 209, 224\u2013314."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"G.B. Agnew","year":"1991","unstructured":"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\u201379.","journal-title":"Journal of Cryptology"},{"issue":"12","key":"25_CR4","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/BF02084158","volume":"21","author":"C.H. Bennet","year":"1982","unstructured":"Bennet, C.H. (1982). The thermodynamics of computation-a rev iew. International Journal of Theoretical Physics, 21, 12, 905\u2013940.","journal-title":"International Journal of Theoretical Physics"},{"key":"25_CR5","first-page":"458","volume":"7","author":"T. Beth","year":"1989","unstructured":"Beth, T., Gollmann, D. (1989). Algorithm Engineering for Public Key Algorithms. IEEE JSAC, 7, 458\u2013466.","journal-title":"IEEE JSAC"},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","first-page":"398","volume-title":"VLSI design for exponentiation in GF(2n)","author":"W. Geiselmann","year":"1990","unstructured":"Geiselmann, W., Gollmann, D. (1990). VLSI design for exponentiation in GF(2n). Proc. of Auscrypt\u201990, Seberry, J., Pieprzyk, J. (eds.), Springer LNCS 453, 398\u2013405."},{"issue":"7","key":"25_CR7","first-page":"636","volume":"32","author":"F. Haining","year":"1996","unstructured":"Haining, F.; Simple multiplication algorithms for a class of GF(2n). Electronics Letters, 28th March 1996; Vol 32, No 7, 636\u2013637.","journal-title":"Simple multiplication algorithms for a class of GF(2n)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/12.2212","volume":"37","author":"I.S. Hsu","year":"1988","unstructured":"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\u2013739.","journal-title":"IEEE Trans. Comp"},{"key":"25_CR9","series-title":"Lect Notes Comput Sci","first-page":"388","volume-title":"Cryptology-CRYPTO\u201999","author":"P. Kocher","year":"1666","unstructured":"Kocher, P., Jaffe, J., Jun, B. (1999). Differential Power Analysis. Advances in Cryptology-CRYPTO\u201999, Wiener, M. (ed.). Springer, LNCS 1666, 388\u2013397."},{"key":"25_CR10","unstructured":"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\u2019 92, IEEE Press."},{"key":"25_CR11","unstructured":"Massey, J.L., Omura, J.K. (1981). Computational method and apparatus for finite field arithmetic. U.S. Patent application."},{"key":"25_CR12","first-page":"21","volume":"4","author":"R.C. Merkle","year":"1993","unstructured":"Merkle, R.C. (1993). Reversible electronic logic using switches. Nanotechnology, 4, 21\u201340.","journal-title":"Reversible electronic logic using switches"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R.C. Mullin","year":"1988","unstructured":"Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A., Wilson, R.M. (1988) Optimal Normal Bases in GF(pn). Discrete Applied Mathematics, 22, 149\u2013161.","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E.R. Berlekamp","year":"1982","unstructured":"Berlekamp, E.R. (1982). Bit-Serial Reed-Solomon Encoders. IEEE Trans.Inf.Th., IT-28, 869\u2013874.","journal-title":"IEEE Trans.Inf.Th"},{"key":"25_CR15","unstructured":"Lidl, R., Niederreiter, H. (1986). Introduction to Finite Fields and Their Applications. Cambridge University Press."},{"key":"25_CR16","unstructured":"MacWilliams, F.J., Sloane, N.J.A. (1977). The Theory of Error-Correcting Codes. North Holland."}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44586-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T16:05:15Z","timestamp":1596902715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44586-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416586","9783540445869"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44586-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"5 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}