{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:17Z","timestamp":1747104197198},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213703"},{"type":"electronic","value":"9783540246541"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24654-1_23","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T12:49:37Z","timestamp":1294404577000},"page":"320-334","source":"Crossref","is-referenced-by-count":9,"title":["Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures"],"prefix":"10.1007","author":[{"given":"Roberto Maria","family":"Avanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Preda","family":"Mih\u0103ilescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-48329-2_13","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M., DeMarrais, J.: A subexponential algorithm for discrete logarithms over all finite fields. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 147\u2013158. Springer, Heidelberg (1994)"},{"key":"23_CR2","unstructured":"Avanzi, R.: On multi-exponentiation in cryptography (2002) (preprint), Available from \n                    \n                      http:\/\/eprint.iacr.org\n                    \n                    \n                  , Newer version: On the complexity of certain multi-exponentiation techniques in cryptography (submitted)"},{"key":"23_CR3","unstructured":"Avanzi, R., Lange, T.: Cryptographic Applications of Trace Zero Varieties (preprint)"},{"issue":"3","key":"23_CR4","first-page":"153","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient Arithmetic in Finite Field Extensions with Applications in Elliptic Curve Cryptography. Journal of Cryptography\u00a014(3), 153\u2013176 (2001)","journal-title":"Journal of Cryptography"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","first-page":"311","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"P. Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 311\u2013323. Springer, Heidelberg (1987)"},{"key":"23_CR6","volume-title":"Fast Algorithm for Digital Signal Processing","author":"R. Blahut","year":"1987","unstructured":"Blahut, R.: Fast Algorithm for Digital Signal Processing. Addison-Wesley, Reading (1987)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-48329-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Bosselaers","year":"1994","unstructured":"Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of three modular reduction functions. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 175\u2013186. Springer, Heidelberg (1994)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24654-1_24","volume-title":"Selected Areas in Cryptography","author":"J. Chung","year":"2004","unstructured":"Chung, J., Hasan, A.: More generalized Mersenne Numbers (Extended Abstract). In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, Springer, Heidelberg (2004)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","first-page":"88","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"J. Gathen von zur","year":"1997","unstructured":"von zur Gathen, J., N\u00f6cker, M.: Exponentiation in finite fields: theory and practice. In: Mattson, H.F., Mora, T. (eds.) AAECC 1997. LNCS, vol.\u00a01255, pp. 88\u2013133. Springer, Heidelberg (1997)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"23_CR11","unstructured":"Grandlund, T.: GMP. A software library for arbitrary precision integers, Available from \n                    \n                      http:\/\/www.swox.com\/gmp\/"},{"key":"23_CR12","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics-Doklady\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Physics-Doklady"},{"issue":"177","key":"23_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comp.\u00a048(177), 203\u2013209 (1987)","journal-title":"Math. Comp."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. of Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J. of Cryptology"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"N. Koblitz","year":"1992","unstructured":"Koblitz, N.: CM-Curves with good Cryptographic Properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 279\u2013287. Springer, Heidelberg (1992)"},{"key":"23_CR16","series-title":"Addison-Wesley Series in Computer Science and Information Processing","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming, 3rd edn. Series in Computer Science and Information Processing. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"23_CR17","unstructured":"Lange, T.: Trace Zero Subvariety for Cryptosystems (submitted)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0027920","volume-title":"Information Security and Privacy","author":"A.K. Lenstra","year":"1997","unstructured":"Lenstra, A.K.: Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997. LNCS, vol.\u00a01270, pp. 127\u2013138. Springer, Heidelberg (1997)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-45537-X_23","volume-title":"Selected Areas in Cryptography","author":"S. Lim","year":"2001","unstructured":"Lim, S., Kim, S., Yie, I., Kim, J., Lee, H.: XTR Extended to GF(p6m\n                           ). In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 301\u2013312. Springer, Heidelberg (2001)"},{"key":"23_CR20","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"issue":"170","key":"23_CR21","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comp.\u00a044(170), 519\u2013521 (1985)","journal-title":"Math. Comp."},{"key":"23_CR22","unstructured":"Mih\u0103ilescu, P.: Optimal Galois Field Bases which are not Normal. In: Recent Results Session, Fast Software Encryption Symposium, Haifa (1997)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"M\u00fcller, V.: Efficient Point Multiplication for Elliptic Curves over Special Optimal Extension Fields. In: Public-Key Cryptography and Computational Number Theory, September 11-15, 2000, Warschau, pp. 197\u2013207. De Gruyter (2001)","DOI":"10.1515\/9783110881035.197"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008350005447","volume":"19","author":"A. Odlyzko","year":"2000","unstructured":"Odlyzko, A.: Discrete Logarithms: The past and the future. Designs, Codes and Cryptography\u00a019, 129\u2013145 (2000)","journal-title":"Designs, Codes and Cryptography"},{"key":"23_CR26","unstructured":"Quisquater, J.-J.: Proc\u00e9d\u00e9 de Codage selon la Methode dite RSA, par un Microcontr \u00f4leur et Dispositifs Utilisant ce Proc\u00e9d\u00e9. Demande de brevet Fran\u00e7ais (D\u00e9p\u00f4t num\u00e9ro: 90 02274) (February 1990)"},{"key":"23_CR27","unstructured":"Quisquater, J.-J.: Encoding System According to the So-called RSA Method, by Means of a Microcontroller and Arrangement Implementing this System. U.S. Patent 5,166,978 (November 1992)"},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. Advances in Computers\u00a01, 231\u2013308 (1960)","journal-title":"Advances in Computers"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing\u00a07, 281\u2013292","DOI":"10.1007\/BF02242355"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1090\/S0025-5718-99-01137-0","volume":"69","author":"O. Schirokauer","year":"2000","unstructured":"Schirokauer, O.: Using number fields to compute logarithms in finite fields. Math. Comp.\u00a069, 1267\u20131283 (2000)","journal-title":"Math. Comp."},{"key":"23_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-36492-7_3","volume-title":"Selected Areas in Cryptography","author":"F. Sica","year":"2003","unstructured":"Sica, F., Ciet, M., Quisquater, J.-J.: Analysis of the Gallant-Lambert-Vanstone Method based on Efficient Endomorphisms: Elliptic and Hyperelliptic Curves. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 21\u201336. Springer, Heidelberg (2003)"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J.A. Solinas","year":"1997","unstructured":"Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 357\u2013371. Springer, Heidelberg (1997)"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-36400-5_24","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Stam","year":"2003","unstructured":"Stam, M., Lenstra, A.K.: Efficient subgroup exponentiation in quadratic and sixth degree extensions. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 318\u2013332. Springer, Heidelberg (2003)"},{"key":"23_CR34","unstructured":"Stam, M.: Speeding up Subgroup Cryptosystems. Ph.D. Thesis, Technical University of Eindhoven (2003) ISBN 90-386-0692-3"},{"key":"23_CR35","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"E.R. Verheul","year":"2000","unstructured":"Verheul, E.R., Lenstra, A.K.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"23_CR36","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A.C. Yao","year":"1976","unstructured":"Yao, A.C.: On the evaluation of powers. SIAM Journal on Computing\u00a05, 100\u2013103 (1976)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24654-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T02:58:22Z","timestamp":1620010702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24654-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213703","9783540246541"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24654-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}