{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:11:58Z","timestamp":1725516718817},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694984"},{"type":"electronic","value":"9783540694991"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69499-1_6","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"62-76","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Finite Fields in the Maxima Computer Algebra System"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Caruso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacopo","family":"D\u2019Aurizio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alasdair","family":"McAndrew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E. Brickell","year":"1993","unstructured":"Brickell, E., Gordon, D., McCurley, K., Wilson, D.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"key":"6_CR2","unstructured":"Caruso, F., D\u2019Aurizio, J., Mc Andrew, A.: On line manual on Finite Fields in Maxima (2007), \n                    \n                      http:\/\/www.dm.unipi.it\/~caruso"},{"issue":"5","key":"6_CR3","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B. Chor","year":"1988","unstructured":"Chor, B., Rivest, R.L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory\u00a034(5, part 1) 901\u2013909 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01448423","volume":"63","author":"M. Cipolla","year":"1907","unstructured":"Cipolla, M.: Sulla risoluzione apiristica delle congruenze binomie secondo un modulo primo. Mathematische Annalen\u00a063, 54\u201361 (1907)","journal-title":"Mathematische Annalen"},{"key":"6_CR5","volume-title":"MuPAD Tutorial","author":"C. Creutzig","year":"2004","unstructured":"Creutzig, C., Oevel, W.: MuPAD Tutorial, 2nd edn. Springer, Heidelberg (2004)","edition":"2"},{"key":"6_CR6","series-title":"AES\u2014the advanced encryption standard","volume-title":"Information Security and Cryptography","author":"J. Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The design of Rijndael. In: Information Security and Cryptography. AES\u2014the advanced encryption standard. Springer, Heidelberg (2002)"},{"key":"6_CR7","unstructured":"Pari Group. GP\/Pari on line documentation (2003), \n                    \n                      http:\/\/pari.math.u-bordeaux.fr\/"},{"key":"6_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0023-6","volume-title":"Introduction to Maple","author":"A. Heck","year":"2003","unstructured":"Heck, A.: Introduction to Maple, 3rd edn. Springer, Heidelberg (2003)","edition":"3"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in \n                    \n                      \n                    \n                    $\\mathbb{F}_{2^m}$\n                   using normal bases. Inform. and Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inform. and Comput."},{"key":"6_CR10","series-title":"The scientific computation system, With a foreword by David V. Chudnovsky and Gregory V. Chudnovsky","volume-title":"AXIOM","author":"R.D. Jenks","year":"1992","unstructured":"Jenks, R.D., Sutor, R.S.: AXIOM. The scientific computation system, With a foreword by David V. Chudnovsky and Gregory V. Chudnovsky. Numerical Algorithms Group Ltd., Oxford (1992)"},{"key":"6_CR11","unstructured":"Lehmer, D.H.: Computer technology applied to the theory of numbers. In: Studies in Number Theory, pp. 117\u2013151; Math. Assoc. Amer. (distributed by Prentice-Hall, Englewood Cliffs, N.J.) (1969)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/1352135.1352247","volume-title":"SIGCSE 2008: Proceedings of the 39th SIGCSE technical symposium on Computer science education","author":"A. McAndrew","year":"2008","unstructured":"McAndrew, A.: Teaching cryptography with open-source software. In: SIGCSE 2008: Proceedings of the 39th SIGCSE technical symposium on Computer science education, pp. 325\u2013329. ACM, New York (2008)"},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R.J. McEliece","year":"1987","unstructured":"McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Boston (1987)"},{"key":"6_CR14","series-title":"CRC Press Series on Discrete Mathematics and its Applications","volume-title":"Handbook of applied cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1997) (With a foreword by Ronald L. Rivest)"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/B:DESI.0000015890.44831.e2","volume":"31","author":"S. M\u00fcller","year":"2004","unstructured":"M\u00fcller, S.: On the Computation of Square Roots in Finite Fields. Designs, Codes and Cryptography\u00a031(3), 301\u2013312 (2004)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Information Theory\u00a0IT-24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Information Theory"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/66062.66067","volume":"23","author":"K.T. Rowney","year":"1989","unstructured":"Rowney, K.T., Silverman, R.D.: Finite field manipulations in Macsyma. SIGSAM Bull.\u00a023(1), 39\u201348 (1989)","journal-title":"SIGSAM Bull."},{"key":"6_CR18","unstructured":"Schelter, W.F., The Maxima Group: Maxima on line documentation (2001), \n                    \n                      http:\/\/maxima.sourceforge.net"},{"key":"6_CR19","unstructured":"Shanks, D.: Five Number-Theoretic Algorithms. In: Proceedings of the Second Manitoba Conference on Numerical Mathematics, pp. 51\u201370 (1972)"},{"issue":"189","key":"6_CR20","doi-asserted-by":"publisher","first-page":"435","DOI":"10.2307\/2008704","volume":"54","author":"V. Shoup","year":"1990","unstructured":"Shoup, V.: New Algorithms for Finding Irredicible Polynomials Over Finite Fields. Mathematics of Computation\u00a054(189), 435\u2013447 (1990)","journal-title":"Mathematics of Computation"},{"issue":"197","key":"6_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.2307\/2153041","volume":"58","author":"V. Shoup","year":"1992","unstructured":"Shoup, V.: Searching for Primitive Roots in Finite Fields. Math. Comp.\u00a058(197), 369\u2013380 (1992)","journal-title":"Math. Comp."},{"key":"6_CR22","unstructured":"Stickelberger, L.: \u00dcber eine neue Eigenschaft der Diskriminanten algebraischer Zahlk\u00f6rper. In: Verhandlungen des ersten Internationalen Mathematiker-Kongresses, pp. 182\u2013193 (1897)"},{"key":"6_CR23","unstructured":"Tonelli, A.: Bemerkung \u00fcber die Aufl\u00f6sung quadratischer Congruenzen. G\u00f6ttingen Nachrichten, 344\u2013346 (1891)"},{"key":"6_CR24","first-page":"1","volume":"10","author":"Y. Wang","year":"1961","unstructured":"Wang, Y.: On the least primitive root of a prime. Sci. Sinica\u00a010, 1\u201314 (1961)","journal-title":"Sci. Sinica"},{"key":"6_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04773-6","volume-title":"Number Theory for Computing","author":"S.Y. Yan","year":"2002","unstructured":"Yan, S.Y.: Number Theory for Computing, 2nd edn. Springer, New York (2002)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69499-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T09:13:51Z","timestamp":1551518031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69499-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540694984","9783540694991"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69499-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}